Bi-Immunity Separates Strong NP-Completeness Notions
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
SIGACT news complexity theory column 40
ACM SIGACT News
Bi-immunity separates strong NP-completeness notions
Information and Computation
Theoretical Computer Science
Comparing reductions to NP-complete sets
Information and Computation
Query-monotonic Turing reductions
Theoretical Computer Science
Query-monotonic turing reductions
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A thirty year old conjecture about promise problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |