Optimal proof systems for propositional logic and complete sets

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

Volumn 1373 LNCS, Issue , 1998, Pages 477-487

  Messner, Jochen ^a   Torán, Jacobo ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE SETS; COMPLEXITY CLASS; EXPONENTIAL TIME; INFORMATION CONTENTS; POLYNOMIAL-TIME COMPUTABLE FUNCTIONS; PROOF SYSTEM; PROPOSITIONAL LOGIC; RELATIVE STRENGTH; SUFFICIENT CONDITIONS;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FORMAL LOGIC; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

PROGRAMMABLE LOGIC CONTROLLERS;

EID: 78649822941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028583     Document Type: Conference Paper

References (17)

1. E. Allender. Invertible functions. Ph.D. dissertation, Georgia Institute of Technology, 1985.
2. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
3. S. Buss. Lectures on Proof Theory. Tech Report No. SOCS-96.1, McGill University, 1996. (http://www.cs.mcgill.ca/~denis/TR.96.1.ps.gz)
4. J. Cai and L. Hemachandra. On the power of parity polynomial time. Mathematical Systems Theory 23, pp. 95-106, 1990.
5. S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44, pp. 36-50, 1979.
6. J. Hartmanis. Generalized Kolmogorov complexity and the structure of feasible computations. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS'83), pp. 439-445, 1983
7. J. Hartmanis and L. Hemachandra Complexity classes without machines: On complete languages for UP. Theoretical Computer Science, 58, pp. 129-142, 1988.
8. J. Hartmanis and J. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34, pp. 17-32, 1984.
9. L. Hemaspaandra, S. Jain and N. Vereshchagin. Banishing robust Turing completeness. Int. Journal of Foundations of Computer Science, 4, pp. 245-265, 1993.
10. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 302-309, 1980.
11. J. Krajíček. Bounded Arithmetic, Propositional Logic and Complexity Theory Cambridge University Press 1995.
12. J. Krajíček and P. Pudlák. Propositional proof systems, the consistency of first order theories and the complexity of computations. Journal of Symbolic Logic 54, pp. 1063-1079, 1989.
13. P. Pudlák. On the length of proofs of finitistic consistency statements in first order theories. Logic Colloquium'84 (J. B. Paris et al., editors), North-Holland, Amsterdam, pp. 165-196, 1986
14. A. A. Razborov. On provably disjoint NP-pairs. Technical Report RS-94-36, Basic Research in Computer Science Center, Aarhus, 1994.
15. U. Schöning. On random reductions from sparse sets to tally sets. Information Processing Letters, 46, pp. 239-241, 1993.
16. A. Urquhart. The complexity of propositional proofs. Bulletin of Symbolic Logic 1, pp. 425-467, 1995.
17. L. Valiant. The relative complexity of checking and evaluating. Information Processing Letters, 5, pp. 20-23, 1976.