Separating classes in the exponential-time hierarchy from classes in PH

Unconditional Lower Bounds against Advice

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I

Separating NE from Some Nonuniform Nondeterministic Complexity Classes

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Journal of Computer and System Sciences

Separating NE from some nonuniform nondeterministic complexity classes

Journal of Combinatorial Optimization

NE is not NP turing reducible to nonexponentially dense NP sets

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics