Comparing reductions to NP-complete sets
Information and Computation
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
SIGACT news complexity theory column 64
ACM SIGACT News
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Characterizations and Existence of Easy Sets without Hard Subsets
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
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 | 0.00 |