Optimal proof systems imply complete sets for promise classes

Information and Computation

Volumn 184, Issue 1, 2003, Pages 71-92

  Köbler, Johannes ^a   Messner, Jochen ^b   Torán, Jacobo ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

Complete sets; Optimal proof systems

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER SIMULATION; FORMAL LOGIC; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

OPTIMAL PROOF SYSTEMS; PROPOSITIONAL LOGIC;

SET THEORY;

EID: 0038127228     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00058-0     Document Type: Article

References (29)

1. E. Allender, Invertible functions, Ph.D. thesis, Georgia Institute of Technology, 1985.
2. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11, Springer, Berlin, 1988.
3. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity II. EATCS Monographs on Theoretical Computer Science, vol. 22, Springer, Berlin, 1990.
4. S. Ben-David, A. Gringauze, On the existence of optimal proof systems and oracle-relativized propositional logic, Technical Report TR98-021, Electronic Colloquium on Computational Complexity, 1998.
5. R.V. Book, Tally languages and complexity classes, Information and Control 26 (1974) 186-193.
6. B. Borchert, Predicate classes, promise classes, and the acceptance power of rectangular languages, Ph.D. thesis, Ruprecht-Karls-Universität, Heidelberg, 1994.
7. D.P. Bovet, P. Crescenzi, R. Silvestri, A uniform approach to define complexity classes, Theoretical Computer Science 104 (1992) 263-283.
8. H. Buhrman, S. Fenner, L. Fortnow, D. van Melkebeek, Optimal proof systems and sparse sets, in: Proceedings of the 17th Symposium on Theoretical Aspects of Computer Science (STACS '00), Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 407-418.
9. S. Buss, Lectures on proof theory, Technical Report No. SOCS-96.1, McGill University, 1996 (http://www.cs.mcg-ill.ca/denis/TR.96.1.ps.gz).
10. J. Cai, L. Hemachandra, On the power of parity polynomial time, Mathematical Systems Theory 23 (1990) 95-106.
11. J.L. Carter, M.N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences 18 (1979) 143-154.
12. S. Cook, R. Reckhow, On the lengths of proofs in the propositional calculus, in: Proceedings of the 6th ACM Symposium on Theory of Computing, STOC 74, 1974, pp. 135-148.
13. S. Cook, R. Reckhow, The relative efficiency of propositional proof systems, Journal of Symbolic Logic 44 (1979) 36-50.
14. J. Hartmanis, N. Immerman, V. Sewelson, Sparse sets in NP-P: EXPTIME versus NEXPTIME, Information and Control 65 (1985) 158-181.
15. J. Hartmanis, L. Hemachandra, Complexity classes without machines: on complete languages for UP, Theoretical Computer Science 58 (1988) 129-142.
16. J. Köbler, J. Messner, Complete problems for promise classes by optimal proof systems for test sets, in: Proceedings of the 13th Annual IEEE Conference on Computational Complexity, CCC 98, 1998, pp. 132-140.
17. J. Köbler, Lowness-Eigenschaften und Erlernbarkeit von Booleschen Schaltkreisklassen, Habilitation thesis, Universität Ulm, 1995.
18. W. Kowalczyk, Some connections between representability of complexity classes and the power of formal systems of reasoning, in: Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 176, Springer, Berlin, 1984, pp. 364-369.
19. J. Krajíček, Bounded Arithmetic, Propositional Logic, and Complexity Theory, Cambridge University Press, Cambridge, 1995.
20. J. Krajíček, P. Pudlák, Propositional proof systems, the consistency of first order theories and the complexity of computations, Journal of Symbolic Logic 54 (1989) 1063-1079.
21. J. Messner, J. Torán, Optimal proof systems for propositional logic and complete sets, in: Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science '98, Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, pp. 477-487.
22. P. Pudlák, On the length of proofs of finitistic consistency statements in first order theories, in: J.B. Paris, et al. (Eds.), Logic Colloquium '84, North-Holland, Amsterdam, 1986, pp. 165-196.
23. A.A. Razborov, On provably disjoint NP-pairs. Technical Report RS-94-36, Basic Research in Computer Science Center, Aarhus, 1994.
24. Z. Sadowski, On an optimal quantified propositional proof system and a complete language for N P ∩ co-N P, in: Proceedings of the 11th International Symposium on Fundamentals of Computing Theory, Lecture Notes in Computer Science, vol. 1279, Springer, Berlin, 1997, pp. 423-428.
25. M. Sipser, A complexity theoretic approach to randomness, Proceedings of the 15th ACM Symposium on Theory of Computing, ACM Press, New York, 1983, pp. 330-335.
26. L. Stockmeyer, On approximation algorithms for #P, SIAM Journal on Computing 14 (4) (1985) 849-861.
27. A. Urquhart, The complexity of propositional proofs, Bulletin of Symbolic Logic 1 (1995) 425-467.
28. Deleted in proof.
29. N.K. Vereshchagin, Relativizable and non-relativizable theorems in the polynomial theory of algorithms, Izvestija Rossijskoj Akedemii Nauk 57 (1993) 51-90.