Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875703 | Theoretical Computer Science | 2018 | 12 Pages |
Abstract
An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over +,Ã where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of (possibly exponentially many) ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Meena Mahajan, Anuj Tawari,