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

We study structural properties of restricted width arithmetical circuits. It, is shown that syntactically multilinear arithmetical circuits of constant width call be efficiently simulated by syntactically multilinear algebraic branching programs of constant, width, i.e. that sm-VSCo subset of sm-VBWBP. Also, we obtain a direct characterization of poly-size arithmetical formulas ill terms Of multiplicatively disjoint constant width circuits, i.e. MD-VSCo = VNC1. For log-width weakly-skew circuits a width efficient multilinearity preserving simulation by algebraic branching programs is given, i.e. weaklyskew-sm-VSC1 subset of sm-VBP[width=log(2) n]. Finally, coefficient functions are considered, and closure properties are observed for sm-VSCi, and ill general for a variety of other syntactic multilinear restrictions of algebraic complexity classes.