Sciweavers

Share
18 search results - page 1 / 4
» A Lower Bound for the Size of Syntactically Multilinear Arit...
Sort
View
FOCS
2007
IEEE
8 years 11 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
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
8 years 7 months ago
Lower Bounds and Separations for Constant Depth Multilinear Circuits
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
Ran Raz, Amir Yehudayoff
CC
2008
Springer
150views System Software» more  CC 2008»
8 years 5 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
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
9 years 2 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
FSTTCS
2009
Springer
9 years 1 days ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
books