Read-once polynomials: How many summands suffice?
Computational Complexity
2015-12-15 v1
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 ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression.
Cite
@article{arxiv.1512.04386,
title = {Read-once polynomials: How many summands suffice?},
author = {Meena Mahajan and Anuj Tawari},
journal= {arXiv preprint arXiv:1512.04386},
year = {2015}
}
Comments
16 pages