Canonical Disjoint NP-Pairs of Propositional Proof Systems
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.
KeywordsTuring Machine Proof System Canonical Pair Degree Structure Disjoint Pair
Unable to display preview. Download preview PDF.
- [HS01]Homer, S., Selman, A.: Computability and Complexity Theory. In: Texts in Computer Science, Springer, New York (2001)Google Scholar
- [Mes00]Messner, J.: On the Simulation Order of Proof Systems. PhD thesis, Universität Ulm (2000)Google Scholar
- [Mes02]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)Google Scholar
- [Raz94]Razborov, A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity (1994)Google Scholar
- [Reg83]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)Google Scholar