Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Oracles for structural properties: the isomorphism problem and public-key cryptography
Journal of Computer and System Sciences
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 Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
On the Automatizability of Resolution and Related Propositional Proof Systems
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - 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
SIAM Journal on Computing
Canonical disjoint NP-Pairs of propositional proof systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Representable disjoint NP-Pairs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Proof system representations of degrees of disjoint NP-pairs
Information Processing Letters
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
the informational content of canonical disjoint NP-pairs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P). Moreover we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist.