Read-once polynomials: How many summands suffice?
نویسندگان
چکیده
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.
منابع مشابه
Sums of Read-Once Formulas: How Many Summands Suffice?
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.
متن کاملIsomorphism testing of read-once functions and polynomials
In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can ...
متن کاملA Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials
The polynomial identity testing problem, or PIT, asks how we can decide if a polynomial is equivalent to zero. A read-once polynomial (ROP) is a polynomial over some field that can be expressed with an arithmetic formula where each variable appears at most once. We construct a deterministic polynomial time algorithm for identity testing a black-box ROP. In particular, we show that for a read-on...
متن کاملThe Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits
We investigate the computational complexity of the isomorphism Abstract-1 problem for read-once branching programs (1-BPI): upon input of two read-once branching programs B0 and B1, decide whether there exists a permutation of the variables of B1 such that it becomes equivalent to B0. Our main result is that 1-BPI cannot be NP-hard unless the polyAbstract-2 nomial hierarchy collapses. The resul...
متن کاملHow to Reuse a "Write-Once" Memory
Storage media such as digital optical disks, PROMS, or paper tape consist of a number of "write-once" bit positions (wits); each wit initially contains a "0" that may later be irreversibly overwritten with a "1." It is demonstrated that such "write-once memories" (woms) can be "rewritten" to a surprising degree. For example, only 3 wits suffice to represent any 2-bit value in a way that can lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1512.04386 شماره
صفحات -
تاریخ انتشار 2015