In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
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
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Two variable vs. linear temporal logic in model checking and games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Oblivious symmetric alternation
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects 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
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
Hi-index | 0.00 |