Theory of semi-feasible algorithms
From MaRDI portal
Publication:5959347
zbMath1021.68042MaRDI QIDQ5959347
Leen Torenvliet, Hemaspaandra, Lane A.
Publication date: 1 April 2002
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
Separating NE from Some Nonuniform Nondeterministic Complexity Classes ⋮ Dimension and the structure of complexity classes ⋮ Polynomial-time axioms of choice and polynomial-time cardinality ⋮ Fixed-parameter decidability: Extending parameterized complexity analysis ⋮ The consequences of eliminating NP solutions ⋮ Some connections between bounded query classes and non-uniform complexity. ⋮ Separating NE from some nonuniform nondeterministic complexity classes ⋮ The Power of Self-Reducibility: Selectivity, Information, and Approximation ⋮ The communication complexity of enumeration, elimination, and selection ⋮ Closure and nonclosure properties of the classes of compressible and rankable sets ⋮ Choosing, agreeing, and eliminating in communication complexity
This page was built for publication: Theory of semi-feasible algorithms
