The complexity of promise problems with applications to public-key cryptography
Information and Control
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Promise problems complete for complexity classes
Information and Computation
The topology of provability in complexity theory
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
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)
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
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
Optimal Proof Systems for Propositional Logic and Complete Sets
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Optimal Proof Systems and Sparse Sets
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Diagonalization Methods and the Structure of Language Classes
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
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
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
| Hi-index | 5.23 |
We survey recent results on disjoint NP-pairs. In particular, we survey the relationship of disjoint NP-pairs to the theory of proof systems for propositional calculus.