A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

14 years 11 months ago

Download www.wisdom.weizmann.ac.il

We construct an explicit polynomial f(x1, . . . , xn), with coeﬃcients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least Ω(n4/3/ log2 n). The lower bound holds over any ﬁeld.

Ran Raz, Amir Shpilka, Amir Yehudayoff

Real-time Traffic

Explicit Polynomial | FOCS 2007 | Lower Bound | Multilinear Arithmetic Circuit | Theoretical Computer Science |

claim paper

» Balancing Syntactically Multilinear Arithmetic Circuits

» Noncommutative circuits and the sumofsquares problem

» Arithmetic Circuits and the Hadamard Product of Polynomials

» Balancing Bounded Treewidth Circuits

» NonCommutative Arithmetic Circuits Depth Reduction and Size Lower Bounds

» On the Incompressibility of Monotone DNFs

» Arithmetic Circuits A Chasm at Depth Four

» Polynomial Vicinity Circuits and Nonlinear Lower Bounds

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Ran Raz, Amir Shpilka, Amir Yehudayoff

Comments (0)

Sciweavers

A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

Explicit Polynomial | FOCS 2007 | Lower Bound | Multilinear Arithmetic Circuit | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers