Relativized NP search problems and prepositional proof systems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 54-67

  Buresh Oppenheim, Joshua ^a   Morioka, Tsuyoshi ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; HAMILTONIAN CYCLE; PROPOSITIONAL PROOF SYSTEMS;

COMPUTATIONAL METHODS; GAME THEORY; HAMILTONIANS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTATIONAL COMPLEXITY;

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

References (28)

1. T. P. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question. SIAM Journal on Computing, 4:431-442, 1975.
2. P. W. Beame, S. A. Cook, J. Edmonds, R. Impagliazzo, and T. Pitassi. The relative complexity of NP search problems. Journal of Computer and System Sciences, 57:3-19, 1998.
3. P. W. Beame and T. Pitassi. An exponential separation between the parity principle and the pigeonhole principle. Annals of Pure and Applied Logic, 80:197-222, 1996.
4. M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In 28th Annual Symposium on Foundations of Computer Science, pages 118-126, Los Angeles, CA, Oct. 1987. IEEE.
5. S. R. Buss. Bounded Arithmetic. Bibliopolis, 1986.
6. S. R. Buss. First-order proof theory of arithmetic. In S. R. Buss, editor, Handbook of proof theory, pages 79-147. Elsevier Science, 1998.
7. S. R. Buss. Lower bounds on Nullstellensatz proofs via designs. In P. W. Beame and S. R. Buss, editors, Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 59-71. American Mathematical Society, 1998.
8. S. R. Buss and J. Krajicek. An application of Boolean complexity to separation problems in bounded arithmetic. Proceedings of the London Mathematical Society, 69:1-27, 1994.
9. M. Chiari and J. Krajicek. Witnessing functions in bounded arithmetic and search problems. The Journal of Symbolic Logic, 63:1095-1115, 1998.
10. M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Gröbner basis algorithm to find proofs of unsatisfiability. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pages 174-183, Philadelphia, PA, May 1996.
11. S. A. Cook, R. Impagliazzo, and T. Yamakami. A tight relationship between generic oracles and type-2 complexity. Information and Computation, 137(2):159-170, 1997.
12. L. Fortnow and M. Sipser. Are there interactive proofs for coNP languages? Information Processing Letters, 28:249-251, 1988.
13. Hartmanis, Chang, Chan, Ranjan, and Rohatgi. Relativization: A revisionistic retrospective, BEATCS; Bulletin of the European Association for Theoretical Computer Science, 47, 1992.
14. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37:79-100, 1988.
15. J. Krajicek. Bounded Arithmetic, Propositional Logic, and Complexity Theory, volume 60 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, 1995.
16. J. Krajíček, P. Pudlák, and A. Woods. Exponential lower bounds to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms, 7(1), 1995.
17. A. Maciel, T. Pitassi, and A. R. Woods. A new proof of the weak pigeonhole principle. In ACM, editor, Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21-23, [2000], pages 368-377, New York, NY, USA, 2000. ACM Press.
18. N. Megiddo and C. H. Papadimitriou. On total functions, existence theorems and computational complexity. Theoretical Computer Science, 81:317-324, 1991.
19. T. Morioka. Classification of Search Problems and Their Definability in Bounded Arithmetic. Master's thesis, University of Toronto, 2001. Also available as ECCC technical report TR01-82 at http://www.eccc.uni-trier.de.
20. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
21. C. H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48:498-532, 1994.
22. J. Paris and A. Wilkie. Counting problems in bounded arithmetic. In Methods in Mathematical Logic: Proceedings of the 6th Latin American Symposium on Mathematical Logic 1983, volume 1130 of Lecture notes in Mathematics, pages 317-340, Berlin, 1985. Springer-Verlag.
23. T. Pitassi, P. W. Beame, and R. Impagliazzo. Exponential lower bounds for the pigeonhole principle. Computational Complexity, 3(2):97-140, 1993.
24. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic, 62(3):981-998, Sept. 1997.
25. A. A. Razborov. Lower bounds for the polynomial calculus. Computational Complexity, 7(4):291-324, 1998.
26. S. Riis. Making infinite structures finite in models of second order bounded arithmetic. In P. Clote and J. Krajicek, editors, Arithmetic, Proof Theory, and Computational Complexity, pages 289-319. Oxford University Press, 1993.
27. M. Townsend. Complexity for type-2 relations. Notre Dame Journal of Formal Logic, 31(2):241-262, 1990.
28. M. Yannakakis. Computational complexity. In E. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 19-55. John Wiley and Sons Ltd., 1997.