NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Hausdorff dimension and oracle constructions
Theoretical Computer Science
Journal of Computer and System Sciences
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Random access to advice strings and collapsing results
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hi-index | 0.00 |