Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Reductions to the set of random strings: the resource-bounded case
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |