NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Is the Standard Proof System for SAT P-Optimal?
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Information and Computation
Information and Computation
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
Hi-index | 0.00 |