Annual review of computer science: vol. 3, 1988
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient parallel evaluation of straight-line code and arithmetic circuits
SIAM Journal on Computing
On the parallel evaluation of multivariate polynomials
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An exponential lower bound for depth 3 arithmetic circuits
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A combinatorial algorithm for the determinant
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Clifford algebras and approximating the permanent
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
Clifford algebras and approximating the permanent
Journal of Computer and System Sciences - STOC 2002
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
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh 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
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
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
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
On Lower Bounds for Constant Width Arithmetic Circuits
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Almost settling the hardness of noncommutative determinant
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the power of algebraic branching programs of width two
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algebraic proofs over noncommutative formulas
Information and Computation
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Algebraic proofs over noncommutative formulas
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On the nonnegative rank of distance matrices
Information Processing Letters
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
Approximating the Permanent via Nonabelian Determinants
SIAM Journal on Computing
Counting paths in planar width 2 branching programs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Noncommutativity makes determinants hard
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Tensor-Rank and Lower Bounds for Arithmetic Formulas
Journal of the ACM (JACM)
Non-commutative arithmetic circuits with division
Proceedings of the 5th conference on Innovations in theoretical computer science
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
| Hi-index | 0.00 |