Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
The topology of provability in complexity theory
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Oracles for structural properties: the isomorphism problem and public-key cryptography
Journal of Computer and System Sciences
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Computability and complexity theory
Computability and complexity theory
On Reducibility and Symmetry of Disjoint NP-Pairs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Structure of the Simulation Order of Proof Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Diagonalization Methods and the Structure of Language Classes
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
SIAM Journal on Computing
Classes of representable disjoint NP-pairs
Theoretical Computer Science
Disjoint NP-pairs from propositional proof systems
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
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.