Back to Search
Start Over
Fine hierarchies and m-reducibilities in theoretical computer science
- Source :
-
Theoretical Computer Science . Oct2008, Vol. 405 Issue 1/2, p116-163. 48p. - Publication Year :
- 2008
-
Abstract
- Abstract: This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and related techniques play a crucial role in understanding complexity of finite and infinite computations. We try not only to present the corresponding notions and facts from the particular fields but also to identify the unifying notions, techniques and ideas. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 405
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 34203027
- Full Text :
- https://doi.org/10.1016/j.tcs.2008.06.031