STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
SIGACT news complexity theory column 40
ACM SIGACT News
Theoretical Computer Science
Comparing reductions to NP-complete sets
Information and Computation
Query-monotonic Turing reductions
Theoretical Computer Science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
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
| Hi-index | 5.23 |