A taxonomy of complexity classes of functions

Journal of Computer and System Sciences

Volumn 48, Issue 2, 1994, Pages 357-381

  Selman, Alan L ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DECISION THEORY; EQUIVALENCE CLASSES; FUNCTION EVALUATION; POLYNOMIALS; SET THEORY;

COMPLEXITY CLASSES; FUNCTION CLASSES; MULTIVALUED FUNCTION; NONDETERMINISTIC FUNCTION; POLYNOMIAL TIME; TAXONOMY;

COMPUTATIONAL COMPLEXITY;

EID: 0028408927     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(05)80009-1     Document Type: Article

References (25)

1. P-printable sets
2. NP-Hard Sets Are P-Superterse Unless R = NP
3. On truth table reducibility to sat and the difference hierarchy over NP
4. On the power of probabilistic polynomial time
5. Quantitative relativations of complexity classes
6. On the power of parity polynomial time
7. The complexity of theorem-proving procedures
8. The complexity of promise problems with applications to public-key cryptography
9. The ellipsoid method and its consequences in combinatorial optimization
10. Complexity measures for public-key cryptosystems
11. Counting in Structural Complexity Theory
12. NP[log n]and sparse Turing-complete sets for NP
13. The complexity of optimization problems
14. The difference and truth-table hierarchies for NP
15. Polynomial time enumeration reducibility
16. Natural self-reducible sets
17. A survey of one-way functions in complexity theory
18. Positive relativizations of complexity classes
19. On the computational power of PP and ⊕P
20. On polynomial-time truth-table reducibilities of intractable sets to P-selective sets
21. Relative complexity of checking and evaluating
22. NP is as easy as detecting unique solutions
23. Bounded Query Classes
24. Log Query Classes
25. Structural analysis of the complexity of inverse functions