Computer Search for Numerical Instability
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the Size Complexity of Monotone Formulas
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Complexity measures for regular expressions
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Negation can be exponentially powerful
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh 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
Exponential lower bounds for restricted monotone circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
Characterizing Valiant's algebraic complexity classes
Journal of 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
Monotone separations for constant degree polynomials
Information Processing Letters
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics
Exponential time complexity of the permanent and the Tutte polynomial
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Journal of Computer and System Sciences
Valiant’s holant theorem and matchgate tensors
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Monotone multilinear boolean circuits for bipartite perfect matching require exponential size
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.01 |