Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIGACT news complexity theory column 52
ACM SIGACT News
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computation with finite stochastic chemical reaction networks
Natural Computing: an international journal
Structural Complexity of AvgBPP
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
From logarithmic advice to single-bit advice
Studies in complexity and cryptography
Theoretical Computer Science
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |