Affine projections of symmetric polynomials
Journal of Computer and System Sciences - Complexity 2001
Multi-linear formulas for permanent and determinant are of super-polynomial size
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Interpolation of depth-3 arithmetic circuits with two multiplication gates
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Multi-linear formulas for permanent and determinant are of super-polynomial size
Journal of the ACM (JACM)
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Monotone separations for constant degree polynomials
Information Processing Letters
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
"Resistant" polynomials and stronger lower bounds for depth-three arithmetical formulas
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Arithmetic circuit lower bounds via maxrank
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |