TY  - BOOK
AU  - Hemaspaandra, Lane A
AU  - Torenvliet, Leen
TI  - Theory of Semi-Feasible Algorithms
SN  - 3540422005
PY  - 2003///
CY  - Berlin
PB  - Springer
KW  - Computer algorithms
KW  - Computational Complexity
N1  - 1. Introduction to Semi-Feasible Computation.- 2. Advice.- 3. Lowness.- 4. Hardness for Complexity Classes.- 5. Closures.- 6. Generalizations and Related Notions.- A. Definitions of Reductions and Complexity Classes, and Notation List.- A.1 Reductions.- A.2 Complexity Classes.- A.3 Some Other Notation.- References
N2  - The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness
ER  -