How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
How to construct random functions
Journal of the ACM (JACM)
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
The monotone circuit complexity of Boolean functions
Combinatorica
The complexity of Boolean functions
The complexity of Boolean functions
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The expressive power of voting polynomials
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Shrinkage of de Morgan formulae under restriction
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On submodular complexity measures
Poceedings of the London Mathematical Society symposium on Boolean function complexity
A Note on a Theorem of Razborov
A Note on a Theorem of Razborov
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
A geometric approach to quantum circuit lower bounds
Quantum Information & Computation
The geometry of quantum computation
Quantum Information & Computation
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |