The Relative Complexity of NP Search Problems

Journal of Computer and System Sciences

Volumn 57, Issue 1, 1998, Pages 3-19

  Beame, Paul ^a   Cook, Stephen ^e   Edmonds, Jeff ^b   Impagliazzo, Russell ^c   Pitassi, Toniann ^d  

^a UNIVERSITY OF WASHINGTON   (United States)

^b YORK UNIVERSITY   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d University of Arizona   (United States)

^e NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTABILITY AND DECIDABILITY; DECISION THEORY; POLYNOMIALS; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 0032138871     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1575     Document Type: Article

References (16)

1. M. Blum and R. Implagliazzo, Generic oracles and oracle classes, in "Proceedings 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, October 1987," pp. 118-126.
2. P. Beame, R. Implagliazzo, J. Krajíček, T. Pitassi, and P. Pudlák, Lower bounds on Hilbert's nullstellensatz and propositional proofs, in "Proceedings 35th Annual IEEE Symposium on Foundations of Computer Science, Santa Fe, NM, November 1994," pp. 794-806.
3. S. A. Cook, R. Impagliazzo, and T. Yamakami, A tight relationship between generic oracles and type-2 complexity theory, Inform. & Comput. 137(2) (1997), 159-170.
4. M. Fellows and N. Koblitz, Self-witnessing polynomial-time complexity and prime factorization, in "Proceedings, Structure in Complexity Theory, Seventh Annual IEEE Conference, Boston, MA, June 1992," pp. 107-110.
5. J. Hartmanis and L. A. Hemachandra, One-way functions, robustness, and nonisomorphism of NP-complete sets, in "Proceedings, Structure in Complexity Theory, Second Annual IEEE Conference, Cornell University, Ithaca, NY, June 1987," pp. 160-174.
6. J. Hartmanis and L. Hemachandra, One-way functions, robustness, and non-isomorphism of NP-complete sets, Theor. Comput. Sci. 81 (1991), 155-163.
7. R. Impagliazzo and M. Naor, Decision trees and downward closures, in "Proceedings, Structure in Complexity Theory, Third Annual IEEE Conference, Washington, DC, June 1988," pp. 29-38.
8. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, How easy is local search?, J. Comput. System Sci. 37(1) (1988), 79-100.
9. C. H. Papadimitriou, On graph-theoretic lemmata and complexity classes, in "Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, October 1990," pp. 794-801.
10. C. H. Papadimitriou, On inefficient proofs of existence and complexity classes, in "Proceedings of the 4th Czechoslovakian Symposium on Combinatorics, 1991."
11. C. H. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, J. Comput. System Sci. 48 (1994), 498-532.
12. V. R. Pratt, Every prime has a succinct sertificate, SIAM J. Comput. 4 (1975), 214-220.
13. C. H. Papadimitriou, A. A. Schäffer, and M. Yannakakis, On the complexity of local search, in "Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 1990," pp. 438-445.
14. S. Riis, Independence in Bounded Arithmetic, Ph.D. thesis Oxford University, 1993.
15. A by a random oracle A?, Combinatorica 9 (1989), 385-392.
16. M. Townsend, Complexity of type-2 relations, Notre Dame J. Formal Logic 31 ( 1990), 241-262.