Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > READ-ONCE POLYNOMIALS:
Reports tagged with read-once polynomials:
TR15-204 | 14th December 2015
Meena Mahajan, Anuj Tawari

Sums of read-once formulas: How many summands suffice?

Revisions: 2

An arithmetic read-once formula (ROF) is a formula (circuit of fan-out
1) over
$+, \times$ where each variable labels at most one leaf.
Every multilinear polynomial can be expressed as the sum of ROFs.
In this work, we prove, for certain multilinear polynomials,
a tight lower bound ... more >>>




ISSN 1433-8092 | Imprint