Document Type
Article
Publication Date
2009
Abstract
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between propositional proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions.
Q1: For which propositional proof systems f and g does the implication hold, and for which does it fail?
Q2: For which propositional proof systems of different strengths are the canonical pairs equivalent?
Q3: What do (non-)equivalent canonical pairs tell about the corresponding propositional proof systems?
Q4: Is every NP-pair (A, B), where A is NP-complete, strongly many-one equivalent to the canonical pair of some propositional proof system?
In short, we show that Q1 and Q2 can be answered with 'for almost all', which generalizes previous results by Pudlák and Beyersdorff. Regarding Q3, inequivalent canonical pairs tell that the propositional proof systems are not "very similar," while equivalent, P-inseparable canonical pairs tell that they are not "very different." We can relate Q4 to the open problem in structural complexity that asks whether unions of disjoint NP-complete sets are NP-complete. This demonstrates a new connection between propositional proof systems, disjoint NP-pairs, and unions of disjoint NP-complete sets.
Recommended Citation
Glaßer, Christian, Alan L. Selman, and Liyu Zhang. "The informational content of canonical disjoint NP-pairs." International Journal of Foundations of Computer Science 20, no. 03 (2009): 501-522. https://doi.org/10.1142/S012905410900670X
Publication Title
International Journal of Foundations of Computer Science
DOI
10.1142/S012905410900670X
Comments
Original published version available at https://doi.org/10.1142/S012905410900670X