Optimal proof systems imply complete sets for promise classes-Reference-Cited by-同舟云学术

Optimal proof systems imply complete sets for promise classes

Published:2003-07 Issue:1 Volume:184 Page:71-92
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Köbler Johannes,Messner Jochen,Torán Jacobo

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference29 articles.

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. Tally languages and complexity classes;Book;Information and Control,1974

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Further oracles separating conjectures about incompleteness in the finite domain;Theoretical Computer Science;2020-12

2. An oracle separating conjectures about incompleteness in the finite domain;Theoretical Computer Science;2020-02

3. NP-Completeness, Proof Systems, and Disjoint NP-Pairs;LEIBNIZ INT PR INFOR;2020

4. INCOMPLETENESS IN THE FINITE DOMAIN;The Bulletin of Symbolic Logic;2017-12

5. Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT;Unveiling Dynamics and Complexity;2017