Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR07-018 | 1st March 2007 00:00

#### The Informational Content of Canonical Disjoint NP-Pairs

TR07-018
Authors: Christian Glaßer, Alan L. Selman, Liyu Zhang
Publication: 8th March 2007 21:14
Keywords:

Abstract:

We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions.

Q1: Where does the implication [can(f) \le_m can(g) => f \le_s g] hold, and where does it fail?

Q2: Where can we find proof systems of different strengths, but equivalent canonical pairs?

Q3: What do (non-)equivalent canonical pairs tell about the corresponding proof systems?

Q4: Is every NP-pair (A,B), where A is NP-complete, strongly many-one equivalent to the canonical pair of some proof system?

In short, we show that Q1 and Q2 can be answered with "everywhere", which generalizes previous results by Pudlak and Beyersdorff. Regarding Q3, inequivalent canonical pairs tell that the 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 proof systems, disjoint NP-pairs, and unions of disjoint NP-complete sets.

ISSN 1433-8092 | Imprint