Abstract
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure of the class of disjoint NP-pairs and of all canonical pairs is identical. Secondly, we show that this degree structure is not superficial: Assuming there exist P-inseparable disjoint pairs, there exist intermediate disjoint NP-pairs. That is, if (A, B) is a P-separable disjoint NP-pair and (C, D) is a P-inseparable disjoint NP-pair, then there exist P-inseparable, incomparable NP-pairs (E, F) and (G, H) whose degrees lie strictly between (A, B) and (C, D). Furthermore, between any two disjoint NP-pairs that are comparable and inequivalent, such a diamond exists.
The full paper is available at the Electronic Colloquium on Computational Complexity (ECCC), TR04-106.
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
Cook, S., Reckhow, R.: The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44, 36–50 (1979)
Grollmann, J., Selman, A.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing 17(2), 309–335 (1988)
Glaßer, C., Selman, A., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM Journal on Computing 33(6), 1369–1416 (2004)
Homer, S., Selman, A.: Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences 44(2), 287–301 (1992)
Homer, S., Selman, A.: Computability and Complexity Theory. In: Texts in Computer Science, Springer, New York (2001)
Ladner, R.: On the structure of polynomial-time reducibility. Journal of the ACM 22, 155–171 (1975)
Messner, J.: On the Simulation Order of Proof Systems. PhD thesis, Universität Ulm (2000)
Messner, J.: On the structure of the simulation order of proof systems. In: Proceedings 27rd Mathematical Foundations of Computer Science. LNCS, vol. 1450, pp. 581–592. Springer, Heidelberg (2002)
Pudlák, P.: On reducibility and symmetry of disjoint NP-pairs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 621–632. Springer, Heidelberg (2001)
Razborov, A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity (1994)
Regan, K.: On diagonalization methods and the structure of language classes. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 368–380. Springer, Heidelberg (1983)
Regan, K.: The topology of provability in complexity theory. Journal of Computer and System Sciences 36, 384–432 (1988)
Schöning, U.: A uniform approach to obtain diagonal sets in complexity classes. Theoretical Computer Science 18, 95–103 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glaßer, C., Selman, A.L., Zhang, L. (2005). Canonical Disjoint NP-Pairs of Propositional Proof Systems. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_35
Download citation
DOI: https://doi.org/10.1007/11549345_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)