Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
Optimal Proof Systems and Sparse Sets
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Is the Standard Proof System for SAT P-Optimal?
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On an Optimal Deterministic Algorithm for SAT
Proceedings of the 12th International Workshop on Computer Science Logic
On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - Mathematical foundations of computer science
Optimal proof systems imply complete sets for promise classes
Information and Computation
Information and Computation
Reductions between disjoint NP-pairs
Information and Computation
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science
On optimal algorithms and optimal proof systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
We advocate the thesis that the following general statements are equivalent: the existence of an optimal proof system, the existence of an optimal acceptor (an algorithm with optimality property stated only for input strings which are accepted), and the existence of a suitable recursive presentation of the class of all easy (polynomial-time recognizable) subsets of TAUT (SAT). We prove three concrete versions of this thesis with different variants of notions appearing in it. These versions give alternative characterizations of the following problems: the existence of a p-optimal proof system for SAT, the existence of an optimal proof system for TAUT, and the existence of an optimal and automatizable proof system for TAUT.