Computing algebraic formulas using a constant number of registers
SIAM Journal on Computing
Nondeterministic NC1 computation
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
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
The Complexity of Polynomials and Their Coefficient Functions
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Lower Bounds and Separations for Constant Depth Multilinear Circuits
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical 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
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On Lower Bounds for Constant Width Arithmetic Circuits
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| Hi-index | 0.00 |
We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be efficiently simulated by syntactically multilinear algebraic branching programs of constant width, i.e. that sm-VSC 0 *** sm-VBWBP. Also, we obtain a direct characterization of poly -size arithmetical formulas in terms of multiplicatively disjoint constant width circuits, i.e. MD-VSC0 = VNC1. For log -width weakly-skew circuits a width efficient multilinearity preserving simulation by algebraic branching programs is given, i.e. weaklyskew-sm-VSC1 *** sm-VBP[width=log2 n ]. Finally, coefficient functions are considered, and closure properties are observed for sm-VSC i , and in general for a variety of other syntactic multilinear restrictions of algebraic complexity classes.