Theory of Semi-Feasible Algorithms
Material type: TextLanguage: English Series: Monographs in Theoretical Computer Science, EATCS SeriesPublication details: Berlin Springer 2003Description: x, 148pISBN: 3540422005Subject(s): Computer algorithms | Computational Complexity | MathematicsCurrent library | Home library | Call number | Materials specified | Status | Date due | Barcode |
---|---|---|---|---|---|---|
IMSc Library | IMSc Library | 510.6 HEM (Browse shelf (Opens below)) | Available | 48918 |
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.
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.
There are no comments on this title.