Name
Abstract | ||
|---|---|---|
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 on the number of summands in such an expression. |
Year | Venue | DocType |
|---|---|---|
2015 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1512.04386 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meena Mahajan | 1 | 688 | 56.90 |
| anuj tawari | 2 | 0 | 0.34 |