Is the standard proof system for SAT p-optimal?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1974, Issue , 2000, Pages 361-372

  Köbler, Johannes ^a   Messner, Jochen ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE FUNCTIONS; MULTIVALUED FUNCTIONS; NONDETERMINISTIC FUNCTIONS; PROOF SYSTEM; VARIOUS FUNCTIONS;

SOFTWARE ENGINEERING;

EID: 78650817353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_29     Document Type: Conference Paper

References (24)

1. José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural Complexity I. Springer-Verlag, 2nd edition, 1995.
2. Ronald V. Book, Timothy J. Long, and Alan L. Selman. Quantitative relativizations of complexity classes. SIAM Journal on Computing, 13(3):461–487, 1984.
3. Stephen A. Cook and Robert A. Reckhow. The relative efficiency of propositional proof systems. The Journal of Symbolic Logic, 44(1):36–50, 1979.
4. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, and Luca Trevisan. Structure in approximation classes. SIAM Journal on Computing, 28(5):1759–1782, 1999.
5. Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, and John D. Rogers. Invertingo nto functions. In Proceedings of the 11th Conference on Computational Complexity, pages 213–222. IEEE, 1996.
6. Lance Fortnow and John D. Rogers. Separability and one-way functions. In Proceedings of the 5th International Symposium on Algorithms and Computation, LNCS #834, pages 396–404. Springer-Verlag, 1994.
7. Joachim Grollmann and Alan L. Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17(2):309–335, 1988.
8. Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, and Alan L. Selman. Computingsolu tions uniquely collapses the polynomial hierarchy. In Proceedings of the 5th International Symposium on Algorithms and Computation, LNCS #834, pages 56–64. Springer-Verlag, 1994.
9. Russel Impagliazzo and Moni Naor. Decision trees and downward closures (extended abstract). In Proceedings of the Third Conference on Structure in Complexity Theory, pages 29–38. IEEE, 1988.
10. Ker-I Ko. On some natural complete operators. Theoretical Computer Science, 37:1–30, 1985.
11. Johannes Köbler and Jochen Messner. Complete problems for promise classes by optimal proof systems for test sets. In Proceedings of the 13th Conference on Computational Complexity, pages 132–140. IEEE, 1998.
12. Jan Krajíček and Pavel Pudlák. Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic, 54(3):1063–1079, 1989.
13. Jan Krajíček and Pavel Pudlák. Some consequences of cryptographical conjectures for S1 2 and EF. In D. Leivant, editor, Logic and Computational Complexity, LNCS #960, pages 210–220. Springer-Verlag, 1995.
14. Timothy J. Long. On γ-reducibility versus polynomial time many-one reducibility. Theoretical Computer Science, 14:91–101, 1981.
15. Jochen Messner. On optimal algorithms and optimal proof system. In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, LNCS #1563. Springer-Verlag, 1999.
16. Jochen Messner and Jacobo Torán. Optimal proof systems for propositional logic and complete sets. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science, LNCS #1373, pages 477–487. Springer-Verlag, 1998.
17. Christos H. Papadimitriou. Computatational Complexity. Addison-Wesley, 1994.
18. Alexander A. Razborov. On provably disjoint NP-pairs. Technical Report RS-94-36, Basic Research in Computer Science Center, Aarhus, 1994.
19. Zenon Sadowski. On an optimal quantified propositional proof system and a complete language for NP ∩ co-NP. In Proceedings of the 11th International Symposium on Fundamentals of Computing Theory, LNCS #1279, pages 423–428. Springer-Verlag, 1997.
20. Zenon Sadowski. On an optimal deterministic algorithm for SAT. In Proceedings of the 12th Annual Conference of the European Association for Computer Science Logic, CSL’98, LNCS #1584, pages 179–187. Springer-Verlag, 1999.
21. Uwe Schöning. Complexity and Structure, LNCS #211. Springer-Verlag, 1985.
22. Uwe Schöningan and Jacobo Torán. A note on the size of craigin terpolants, 1996. Unpublished manuscript.
23. Alan L. Selman. A taxonomy of complexity classes of functions. Journal of Computer and System Sciences, 48(2):357–381, 1994.
24. Leslie G. Valiant. Relative complexity of checkingan d evaluating. Information Processing Letters, 5(1):20–23, 1976.