Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
Some consequences of cryptographical conjectures for S12 and EF
Information and Computation - Special issue: logic and computational complexity
On Reducibility and Symmetry of Disjoint NP-Pairs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Optimal proof systems imply complete sets for promise classes
Information and Computation
Reductions between Disjoint NP-Pairs
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
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 investigate the class of disjoint NP-pairs under different reductions. The structure of this class is intimately linked to the simulation order of propositional proof systems, and we make use of the relationship between propositional proof systems and theories of bounded arithmetic as the main tool of our analysis. Specifically we exhibit a pair which is complete under strong reductions for all disjoint NP-pairs representable in a theory. We use these pairs to explain the simulation order of NP-pairs under these reductions. As corollaries we also get simplified proofs of results obtained earlier in [3] and [5].