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
SIAM Journal on Computing
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Pseudo-Random Generators and Structure of Complete Degrees
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Properties of NP-Complete Sets
SIAM Journal on Computing
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science
SIAM Journal on Computing
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
Circuit Lower Bounds for Merlin-Arthur Classes
SIAM Journal on Computing
Reductions between disjoint NP-Pairs
Information and Computation
On learning random DNF formulas under the uniform distribution
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Theoretical Computer Science
| Hi-index | 0.00 |
We study the following question: if A and B are disjoint NPcomplete sets, then is A ∩ B NP-complete? We provide necessary and sufficient conditions under which the union of disjoint NP-complete sets remain complete.