Degrees of Dowd-type generic oracles
Information and Computation
Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Information and Computation
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
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Quantitative Aspects of Speed-Up and Gap Phenomena
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Automatic forcing and genericity: on the diagonalization strength of finite automata
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quantitative aspects of speed-up and gap phenomena
Mathematical Structures in Computer Science
| Hi-index | 0.00 |