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
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
SIAM Journal on Computing
Non-automatizability of bounded-depth frege proofs
Computational Complexity
Reductions between disjoint NP-pairs
Information and Computation
Canonical disjoint NP-Pairs of propositional proof systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the Shannon capacity of a graph
IEEE Transactions on Information Theory
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
The deduction theorem for strong propositional proof systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Logical closure properties of propositional proof systems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Proof system representations of degrees of disjoint NP-pairs
Information Processing Letters
Hi-index | 5.23 |
For a propositional 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 canonical NP-pairs associated with 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.