Separation of NP-completeness notions

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 78-89

  Pavan, A ^a   Selman, A L ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

NP-COMPLETENESS NOTION; STRUCTURAL COMPLEXITY THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 0034873741     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. P-printable sets
2. Separating NP-completeness under strong hypotheses
3. Diagonalizations over polynomial time computable sets
4. Genericity and measure for exponential time
5. Resource bounded randomness and weakly complete problems
6. Relativizations of the P = ? NP question
7. The polynomial-time hierarchy and sparse oracles
8. Bi-immune sets for complexity classes
9. Completeness notions for nondeterministic complexity classes
10. On inverting onto functions
11. Distributionally hard languages
12. Separability and one-way functions
13. Discrete logarithms in GF(p) using the number field sieve
14. Complexity measures for public-key cryptosystems
15. P-selective sets and reducing search to decision vs. self-reducibility
16. Easy sets and hard certificate schemes
17. On the computational complexity of algorithms
18. Computation times of NP sets of different densities
19. On 1-truth-table-hard languages
20. On reductions of NP sets to sparse sets
21. Completeness, approximation and density
22. A comparison of polynomial time reducibilities
23. An introduction to Kolmogorov complexity and its applications
24. Cook reducibility is faster than karp reducibility
25. Cook versus Karp-Levin: Separating completeness notions if NP is not small
26. On polynomial time bounded truth-table reducibility of NP sets to sparse sets
27. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
28. Reductions on NP and P-selective sets
29. On polynomial-time truth-table reducibilities of intractable sets to P-selective sets
30. NP is as easy as detecting unique solutions
31. A comparison of polynomial time completeness notions