NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sparse sets and collapse of complexity classes
Information and Computation
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Computational depth: concept and applications
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Theoretical Computer Science
A linearly computable measure of string complexity
Theoretical Computer Science
| Hi-index | 0.00 |