STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
The complexity of planarity testing
Information and Computation
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
A note on the circuit complexity of PP
Theoretical Computer Science
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Journal of Computer and System Sciences
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
Counting classes and the fine structure between NC1and L
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Sparse selfreducible sets and polynomial size circuit lower bounds
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Counting classes and the fine structure between NC1 and L
Theoretical Computer Science
Dimension characterizations of complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |