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
An exponential lower bound for the size of monotone real circuits
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
On the automatizability of resolution and related propositional proof systems
Information and Computation
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science
Classes of representable disjoint NP-pairs
Theoretical Computer Science
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
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
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Mean-payoff games and propositional proofs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Proof system representations of degrees of disjoint NP-pairs
Information Processing Letters
Mean-payoff games and propositional proofs
Information and Computation
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
Optimal acceptors and optimal proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Optimal Proof Systems, Optimal Acceptors and Recursive Presentability
Fundamenta Informaticae
the informational content of canonical disjoint NP-pairs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We consider some problems about pairs of disjoint NP sets. The theory of these sets with a natural concept of reducibility is, on the one hand, closely related to the theory of proof systems for propositional calculus, and, on the other, it resembles the theory of NP completeness. Furthermore, such pairs are important in cryptography. Among others, we prove that the Broken Mosquito Screen pair of disjoint NP sets can be polynomially reduced to Clique-Coloring pair and thus is polynomially separable and we show that the pair of disjoint NP sets canonically associated with the Resolution proof system is symmetric.