Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Polynomial Identity Testing for Read-Once Formulas
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Enumeration of the monomials of a polynomial and related complexity classes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Algebraic independence and blackbox identity testing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An Almost Optimal Rank Bound for Depth-3 Identities
SIAM Journal on Computing
On identity testing of tensors, low-rank recovery and compressed sensing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Algebraic independence and blackbox identity testing
Information and Computation
Hi-index | 0.00 |
In this paper we consider the problem of determining whether an unknown arithmetic circuit, for which we have oracle access, computes the identically zero polynomial. This problem is known as the black-box polynomial identity testing (PIT) problem. Our focusis on polynomials that can be written in the form $f(\bar{x}) =\sum_{i=1}^{k} h_i(\bar{x}) \cdot g_i (\bar{x})$, where each $h_i$ is a polynomial that depends on at most $\rho$ linear functions, and each $g_i$ is a product of linear functions (when $h_i=1$, for each $i$, then we get the class of depth-3 circuits with $k$ multiplication gates, also known as $\Sps(k)$ circuits, but the general case is much richer). When $\max_i(\deg(h_i \cdot g_i))=d$ we say that $f$ is computable by a $\Sps(k,d,\rho)$ circuit. We obtain the following results. 1. A deterministic black-box identity testing algorithm for $\Sps(k,d,\rho)$ circuits that runs in quasi-polynomial time (for $\rho =polylog(n+d)$). 2. A deterministic black-box identity testing algorithm for read-k $\Sps$ circuits (depth-3 circuits where each variable appears at most $k$ times) that runs in time $n^{2^{O(k^2)}}$. This gives a polynomial time algorithm for $k=O(1)$. These are the first sub-exponential black-box PIT algorithms for circuits of depth higher than 2. Our results can also be stated in terms of test sets for the underlying circuit model. A test set is a set of points s.t. if two circuits get the same values one very point of the set then they compute the same polynomial. Thus, our first result gives an explicit test set, of quasi-polynomial size, for $\Sps(k,d,\rho)$ circuits (for $\rho =\mathrm{polylog}(n+d)$). Our second result gives an explicit polynomial size test set for read-k depth-3 circuits. The proof technique involves a construction of a family of affine subspaces that have a {\em rank-preserving} property that is inspired by the construction of {\em linear seeded extractors for affine sources} of Gabizon and Raz \cite{GabizonRaz05}, and a generalization of a theorem of \cite{DvirShpilka06} regarding the structure of identically zero depth-3 circuits with bounded top fan-in.