On the extended direct sum conjecture
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds for non-commutative computation
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the complexity of matrix product
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Computer algebra handbook
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
A differential semantics for jointree algorithms
Artificial Intelligence
Elusive functions and lower bounds for 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)
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
Tensor-Rank and Lower Bounds for Arithmetic Formulas
Journal of the ACM (JACM)
| Hi-index | 0.00 |