A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
On zero-testing and interpolation of k -sparse multivariate polynomials over finite fields
Theoretical Computer Science
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Exponential lower bounds for depth three boolean circuits
Computational Complexity
Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Read-once polynomial identity testing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Detecting Rational Points on Hypersurfaces over Finite Fields
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Algebraic methods for interactive proof systems
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Arithmetic Circuits: A Chasm at Depth Four
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An Almost Optimal Rank Bound for Depth-3 Identities
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
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
Blackbox Polynomial Identity Testing for Depth 3 Circuits
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
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
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
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
Non-uniform ACC Circuit Lower Bounds
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Algebraic independence and blackbox identity testing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Partial Derivatives in Arithmetic Complexity and Beyond (Foundations and Trends(R) in Theoretical Computer Science)
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
SIAM Journal on Computing
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Quasi-polynomial hitting-set for set-depth-Δ formulas
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Arithmetic circuit lower bounds via maxrank
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science
Hi-index | 0.00 |
We present a single common tool to strictly subsume all known cases of polynomial time blackbox polynomial identity testing (PIT), that have been hitherto solved using diverse tools and techniques, over fields of zero or large characteristic. In particular, we show that polynomial time hitting-set generators for identity testing of the two seemingly different and well studied models - depth-3 circuits with bounded top fanin, and constant-depth constant-read multilinear formulas - can be constructed using one common algebraic-geometry theme: Jacobian captures algebraic independence. By exploiting the Jacobian, we design the first efficient hitting-set generators for broad generalizations of the above-mentioned models, namely: - depth-3 (Ω Π Ω) circuits with constant transcendence degree of the polynomials computed by the product gates (no bounded top fanin restriction), and - constant-depth constant-occur formulas (no multilinear restriction). Constant-occur of a variable, as we define it, is a much more general concept than constant-read. Also, earlier work on the latter model assumed that the formula is multilinear. Thus, our work goes further beyond the related results obtained by Saxena & Seshadhri (STOC 2011), Saraf & Volkovich (STOC 2011), Anderson et al. (CCC 2011), Beecken et al. (ICALP 2011) and Grenet et al. (FSTTCS 2011), and brings them under one unifying technique. In addition, using the same Jacobian based approach, we prove exponential lower bounds for the immanant (which includes permanent and determinant) on the same depth-3 and depth-4 models for which we give efficient PIT algorithms. Our results reinforce the intimate connection between identity testing and lower bounds by exhibiting a concrete mathematical tool - the Jacobian - that is equally effective in solving both the problems on certain interesting and previously well-investigated (but not well understood) models of computation.