Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Mahajan, Meena, Tawari, Anuj
Institution: Institute of Mathematical Sciences
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2402034470