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-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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
