Measure Theoretic Completeness Notions for the Exponential Time Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Bias Invariance of Small Upper Spans
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Density of Weakly Complete Problems under Adaptive Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Computability versus exact computability of martingales
Information Processing Letters
A note on dimensions of polynomial size circuits
Theoretical Computer Science
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Computability versus exact computability of martingales
Information Processing Letters
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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 |