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
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
The Shrinking Property for NP and coNP
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The shrinking property for NP and coNP
Theoretical Computer Science
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
Survey of disjoint NP-pairs and relations to propositional proof systems
Theoretical Computer Science
A thirty year old conjecture about promise problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| 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.