期刊名称:Electronic Colloquium on Computational Complexity
印刷版ISSN:1433-8092
出版年度:2015
卷号:2015
出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要: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.