Optimal proof systems imply complete sets for promise classes

```@article{Kbler2003OptimalPS,
title={Optimal proof systems imply complete sets for promise classes},
author={Johannes K{\"o}bler and Jochen Messner and Jacobo Tor{\'a}n},
journal={Inf. Comput.},
year={2003},
volume={184},
pages={71-92}
}```
A polynomial time computable function h : Σ* → Σ* whose range is a set L is called a proof system for L. In this setting, an h-proof for x ∈ L is just a string w with h(w) = x. Cook and Reckhow defined this concept in [13], and in order to compare the relative strength of different proof systems for the set TAUT of tautologies in propositional logic, they considered the notion of p-simulation. Intuitively, a proof system h' p-simulates h if any h-proof w can be translated in polynomial time… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 30 CITATIONS

INCOMPLETENESS IN THE FINITE DOMAIN

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes

• Electronic Colloquium on Computational Complexity
• 2009
VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Nondeterministic functions and the existence of optimal proof systems

• Theor. Comput. Sci.
• 2009
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

On the Existence of Complete Disjoint NP-Pairs

• 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
• 2009
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Classes of representable disjoint NP-pairs

• Theor. Comput. Sci.
• 2007
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Tuples of Disjoint \$\mathsf{NP}\$ -Sets

• Theory of Computing Systems
• 2007
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Tuples of Disjoint NP-Sets

• Electronic Colloquium on Computational Complexity
• 2005
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

• SIGACT News
• 2014

A Parameterized Halting Problem

• The Multivariate Algorithmic Revolution and Beyond
• 2012
VIEW 1 EXCERPT

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

On provably disjoint NP-pairs

• Electronic Colloquium on Computational Complexity
• 1994
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations

• J. Symb. Log.
• 1989
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

The Relative Efficiency of Propositional Proof Systems

• J. Symb. Log.
• 1979
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

VIEW 1 EXCERPT

Book . Tally languages and complexity classes

V. R.
• Information and Control
• 1998

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

• Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)
• 1998
VIEW 2 EXCERPTS

On the Existence of Propositional Proof Systems and Oracle-relativized Propositional Logic

• Electronic Colloquium on Computational Complexity
• 1998
VIEW 1 EXCERPT

VIEW 2 EXCERPTS

Optimal proof systems for Propositional Logic and complete sets

• Electronic Colloquium on Computational Complexity
• 1997
VIEW 3 EXCERPTS

On the power of parity polynomial time

L. Hemachandra
• Mathematical Systems Theory
• 1996