Affine projections of symmetric polynomials
Journal of Computer and System Sciences - Complexity 2001
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
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
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
Tensor-rank and lower bounds for arithmetic formulas
Proceedings of the forty-second ACM symposium on Theory of computing
Non-commutative circuits and the sum-of-squares problem
Proceedings of the forty-second ACM symposium on Theory of computing
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
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
On the incompressibility of monotone DNFs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On identity testing of tensors, low-rank recovery and compressed sensing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Separating multilinear branching programs and formulas
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
"Resistant" polynomials and stronger lower bounds for depth-three arithmetical formulas
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Quasi-polynomial hitting-set for set-depth-Δ formulas
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Tensor-Rank and Lower Bounds for Arithmetic Formulas
Journal of the ACM (JACM)
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
| Hi-index | 0.00 |