Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR15-202 | 11th December 2015 11:34

Building above read-once polynomials: identity testing and hardness of representation

RSS-Feed




TR15-202
Authors: Meena Mahajan, Raghavendra Rao B V, Karteek Sreenivasaiah
Publication: 11th December 2015 11:43
Downloads: 569
Keywords: 


Abstract:

Polynomial Identity Testing (PIT) algorithms have focused on
polynomials computed either by small alternation-depth arithmetic circuits, or by read-restricted
formulas. Read-once polynomials (ROPs) are computed by read-once
formulas (ROFs) and are the simplest of read-restricted polynomials.
Building structures above these, we show the following:
\begin{enumerate}
\item A deterministic polynomial-time non-black-box PIT algorithm for
$\sum^{(2)}\cdot \prod \cdot {ROF}$.
\item Weak hardness of representation theorems for sums of powers of constant-free ROPs and for
ROPs of the form $\sum \cdot \prod \cdot \sum$.
\item A partial characterization of multilinear monotone constant-free ROPs.
\end{enumerate}



ISSN 1433-8092 | Imprint