Complete problems for promise classes by optimal proof systems for test sets

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 132-140

  Kobler J ^a   Messner, J ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; PROGRAMMABLE LOGIC CONTROLLERS;

BOOLEAN FORMULAE; COMPLETE PROBLEMS; COMPLETE SETS; DOUBLE EXPONENTIAL; NONDETERMINISTIC POLYNOMIAL; PROBABILISTIC COMPLEXITY; PROOF SYSTEM; PROPOSITIONAL LOGIC;

C (PROGRAMMING LANGUAGE);

EID: 0010513146     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694599     Document Type: Conference Paper

References (17)

1. [BCS92] D. P. BOVET, P. CRESCENZI, AND R. SILVESTRI. A uniform approach to define complexity classes. Theoretical Computer Science, 104:263-283, 1992.
2. [BDG90] J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ. Structural Complexity II. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.
3. [BDG95] J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1995.
4. [BDG98] S. BEN-DAVID AND A. GRINGAUZE. On the existence of optimal proof systems and oracle-relativized propositional logic. Manuscript, 1998
5. [Boo74] R. BOOK. Tally languages and complexity classes. Information and Control, 26:186-193, 1974.
6. [Bor94] B. BORCHERT. Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages. PhDthesis, Ruprecht-Karls-Universität Heidelberg, 1994.
7. [CR79] S. A. COOK AND R. A. RECKHOW. The relative efficiency of propositional proof systems. The Journal of Symbolic Logic, 44(1):36-50, 1979.
8. [CW79] J. L. CARTER AND M. N. WEGMAN. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
9. [Köb95] J. KÖBLER. Lowness-Eigenschaften und Erlernbarkeit von Booleschen Schaltkreisklassen. Habilitation Thesis, Universit ät Ulm, 1995.
10. [KP89] J. KRAJÍČEK AND P. 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.
11. [MT98] J. MESSNER AND J. TORÁN. Optimal proof systems for propositional logic and complete sets. In Proc. 15th Symposium on Theoretical Aspects of Computer Science '98, Lecture Notes in Computer Science #1373, 477-487. Springer-Verlag, 1998.
12. [Pud86] P. PUDLÁK. On the length of proofs of finitistic consistency statements in first order theories. In J. B. Paris et al., editor, Logic Colloquium'84, 165-196, 1986.
13. [Raz94] A. A. RAZBOROV. On provably disjoint NP-pairs. Technical Report RS-94-36, Basic Research in Computer Science Center, Aarhus, 1994.
14. [Sad97] Z. SADOWSKI. On an optimal quantified propositional proof system and a complete language for NP \ co-NP. In Proc. 11th International Symposium on Fundamentals of Computing Theory, Lecture Notes in Computer Science #1279, 423-428. Springer-Verlag, 1997.
15. [Sip83] M. SIPSER. A complexity theoretic approach to randomness. In Proc. 15th ACM Symposium on Theory of Computing, 330-335. ACM Press, 1983.
16. [Sto85] L. STOCKMEYER. On approximation algorithms for #P. SIAM Journal on Computing, 14(4):849-861, 1985.
17. [Ver93] N. K. VERESHCHAGIN. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestija Rossijskoj Akademii Nauk, 57:51-90, 1993. In Russian.