On optimal algorithms and optimal proof systems

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

Volumn 1563, Issue , 1999, Pages 541-550

  Messner, Jochen ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CYLINDERS (SHAPES);

DETERMINISTIC ALGORITHMS; EXPONENTIAL TIME; NONDETERMINISTIC ALGORITHMS; OPTIMAL ALGORITHM; OPTIMAL TIME; POLYNOMIAL-TIME; PROOF SYSTEM; TIME COMPLEXITY;

POLYNOMIAL APPROXIMATION;

EID: 84957074596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_51     Document Type: Conference Paper

References (13)

1. José Luis Balćazar, Josep Díaz, and Joaquim Gabarró. Structural Complexity II. Springer-Verlag, 1990.
2. José Luis Balćazar, Josep Díaz, and Joaquim Gabarró. Structural Complexity I. Springer-Verlag, 2 edition, 1995.
3. Shai Ben-David and Anna Gringauze. On the existence of optimal propositional proof system and oracle-relativized propositional logic. Technical Report TR98-021, Electronic Colloquium on Computational Complexity, 1998.
4. Stephen A. Cook and Robert A. Reckhow. The relative eficiency of propositional proof systems. The Journal of Symbolic Logic, 44(1):36-50, 1979.
5. Jun Gu, Paul Purdom, John Franco, and Benjamin Wah. Algorithms for the Satisfiability Problem. Cambridge University Press, to appear.
6. Johannes Köbler and Jochen Messner. Complete problems for promise classes by optimal proof systems for test sets. In Proceedings of the 13th Annual IEEE Conference on Computational Complexity, CC 98, pages 132-140, 1998.
7. 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.
8. Leonid A. Levin. Universal search problems (in russian). Problemy Peredachi Informatsii, 9(3):115-116, 1973. English translation in Problems of Information Transmission 9(3):265-266, 1973. Revised translation as an appendix to [13].
9. 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 (STACS'98), number 1373 in Lecture Notes in Computer Science, pages 477-487. Springer-Verlag, 1998.
10. Zenon Sadowski. On an optimal deterministic algorithm for SAT. Presented on the Annual Conference of the European Association for Computer Science Logic, CSL '98. To be published in the LNCS-series of Springer-Verlag.
11. Zenon Sadowski. On an optimal quantified propositional proof system and a complete language for NP\co-NP. In Proceedings of the 11-th International Symposium on Fundamentals of Computing Theory, FCT'97, number 1279 in Lecture Notes in Computer Science, pages 423-428. Springer-Verlag, 1997.
12. Claus-Peter Schnorr. Optimal algorithms for self-reducible problems. In Proceedings of the third International Colloquium on Automata, Languages, and Programming (ICALP'76), pages 322-337. Edinburgh University Press, 1976.
13. Boris A. Trakhtenbrot. A survey of russian approaches to perebor (brute-force search) algorithms. Annals of the History of Computing, 6(4):384-400, 1984.