Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity

Abstract. 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-VSC0 ⊆ 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-VSCi , and in general for a variety of other syntactic multilinear restrictions of algebraic complexity classes.

• Type: Conference
• Year: 2009
• Where: CSR
• Authors: Maurice J. Jansen, B. V. Raghavendra Rao
• Keywords: Arithmetical Circuits, Constant Width, CSR 2009, Theoretical Computer Science, Width Arithmetical Circuits