Relativized circuit complexity
Journal of Computer and System Sciences
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Designing programs that check their work
Journal of the ACM (JACM)
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
Threshold Computation and Cryptographic Security
SIAM Journal on Computing
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
Symmetric alternation captures BPP
Computational Complexity
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Pseudorandomness and Average-Case Complexity via Uniform Reductions
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
A note on the circuit complexity of PP
Theoretical Computer Science
Oracles Are Subtle But Not Malicious
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth 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
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
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
Complexity of Stoquastic Frustration-Free Hamiltonians
SIAM Journal on Computing
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |