Sciweavers

Share
5 search results - page 1 / 1
» Balancing Syntactically Multilinear Arithmetic Circuits
Sort
View
CC
2008
Springer
150views System Software» more  CC 2008»
8 years 4 months ago
Balancing Syntactically Multilinear Arithmetic Circuits
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
Ran Raz, Amir Yehudayoff
FOCS
2007
IEEE
8 years 10 months ago
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
Ran Raz, Amir Shpilka, Amir Yehudayoff
CSR
2009
Springer
8 years 11 months ago
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 effici...
Maurice J. Jansen, B. V. Raghavendra Rao
CSR
2010
Springer
8 years 9 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
9 years 1 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
books