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 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 both parts of Q1 and Q2 can be answered with ‘everywhere’, which generalize previous results by Pudlák 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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beyersdorff, O.: Disjoint NP-pairs from propositional proof systems. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 236–247. Springer, Heidelberg (2006)
Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic 44(1), 36–50 (1979)
Glaßer, C., Pavan, A., Selman, A.L., Sengupta, S.: Properties of NP-complete sets. SIAM Journal on Computing 36(2), 516–542 (2006)
Glaßer, C., Selman, A.L., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM Journal on Computing 33(6), 1369–1416 (2004)
Glaßer, C., Selman, A.L., Travers, S., Wagner, K.W.: The complexity of unions of disjoint sets. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, Springer, Heidelberg (2007)
Glaßer, C., Selman, A.L., Zhang, L.: Survey of disjoint NP-pairs and relations to propositional proof systems. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, Springer, Heidelberg (2006)
Glaßer, C., Selman, A.L., Zhang, L.: Canonical disjoint NP-pairs of propositional proof systems. Theoretical Computer Science 370, 60–73 (2007)
Grollmann, J., Selman, A.L.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing 17(2), 309–335 (1988)
Homer, S., Selman, A.L.: Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences 44(2), 287–301 (1992)
Köbler, J., Messner, J., Torán, J.: Optimal proof systems imply complete sets for promise classes. Information and Computation 184(1), 71–92 (2003)
Meßner, J.: On the Simulation order of proof systems. PhD thesis, Universität Ulm, Abteilung Theoretische Informatik (December 2000)
Pudlák, P.: On reducibility and symmetry of disjoint NP-pairs. Theoretical Computer Science 295, 323–339 (2003)
Razborov, A.A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Computational Complexity Colloquium (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glaßer, C., Selman, A.L., Zhang, L. (2007). The Informational Content of Canonical Disjoint NP-Pairs. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-73545-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73544-1
Online ISBN: 978-3-540-73545-8
eBook Packages: Computer ScienceComputer Science (R0)