Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth 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
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Arithmetic Circuits and Polynomial Replacement Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Uniform Circuits, & Boolean Proof Nets
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Small-space analogues of Valiant's classes
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Succinct algebraic branching programs characterizing non-uniform complexity classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |