NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SIGACT news complexity theory column 40
ACM SIGACT News
Theoretical Computer Science
Nontriviality for exponential time w.r.t weak reducibilities
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Nontriviality for exponential time w.r.t. weak reducibilities
Theoretical Computer Science
Autoreducibility of complete sets for log-space and polynomial-time reductions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 5.23 |