Partial Derivatives in Arithmetic Complexity and Beyond

How complex is a given multivariate polynomial? The main point of this survey is that one can learn a great deal about the structure and complexity of polynomials by studying (some of) their partial derivatives. The bulk of the survey shows that partial derivatives provide essential ingredients in proving both upper and lower bounds for computing polynomials by a variety of natural arithmetic models. We will also see applications which go beyond computational complexity, where partial derivatives provide a wealth of structural information about polynomials (including their number of roots, reducibility and internal symmetries), and help us solve various number theoretic, geometric, and combinatorial problems.

[1]  Daniel A. Spielman,et al.  Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.

[2]  Gian-Carlo Rota,et al.  Apolarity and Canonical Forms for Homogeneous Polynomials , 1993, Eur. J. Comb..

[3]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[4]  Salil P. Vadhan,et al.  Checking polynomial identities over any field: towards a derandomization? , 1998, STOC '98.

[5]  R. J. Lopez.  An Implicit Function , 1994 .

[6]  Zeev Dvir,et al.  Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.

[7]  Ketan Mulmuley,et al.  Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties , 2006, SIAM J. Comput..

[8]  Alexander A. Razborov,et al.  Natural Proofs , 1997, J. Comput. Syst. Sci..

[9]  Noam Nisan,et al.  Lower bounds on arithmetic circuits via partial derivatives , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[10]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[11]  J. M. Landsberg,et al.  An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP , 2009, SIAM J. Comput..

[12]  Ran Raz,et al.  Deterministic polynomial identity testing in non commutative models , 2004 .

[13]  Ketan Mulmuley,et al.  Lower Bounds in a Parallel Model without Bit Operations , 1999, SIAM J. Comput..

[14]  J. Morgenstern,et al.  How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen , 1985, SIGA.

[15]  Enrico Carlini.  Reducing the number of variables of a polynomial , 2006, Algebraic Geometry and Geometric Modeling.

[16]  Hofreiter.  Moderne Algebra , 1936 .

[17]  Ran Raz,et al.  Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.

[18]  Neeraj Kayal.  The Complexity of the Annihilating Polynomial , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[19]  Avi Wigderson,et al.  Extractors And Rank Extractors For Polynomial Sources , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[20]  W. M. Ruppert,et al.  Reducibility of polynomials a0(x) + a1 (x)y + a2 (x) y2 modulo p , 1999 .

[21]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  I. Fischer.  Sums of like powers of multivariate linear forms , 1994 .

[23]  Alexander L. Chistov,et al.  Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic , 1985, FCT.

[24]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[25]  Neeraj Kayal.  Algorithms for Arithmetic Circuits , 2010, Electron. Colloquium Comput. Complex..

[26]  Larry Guth,et al.  Algebraic methods in discrete analogs of the Kakeya problem , 2008, 0812.1043.

[27]  Haim Kaplan,et al.  On Lines and Joints , 2009, Discret. Comput. Geom..

[28]  Dinh Van Huynh,et al.  Algebra and Its Applications , 2006 .

[29]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[30]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[31]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[32]  Manindra Agrawal,et al.  Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.

[33]  Shubhangi Saraf,et al.  High-rate codes with sublinear-time decoding , 2011, STOC '11.

[34]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[35]  Manindra Agrawal,et al.  Primality and identity testing via Chinese remaindering , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[36]  Robin Hartshorne,et al.  Algebraic geometry , 1977, Graduate texts in mathematics.

[37]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[38]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[39]  D. A. Mit'kin.  Stepanov method of the estimation of the number of roots of some equations , 1992 .

[40]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[41]  Amir Shpilka.  Affine projections of symmetric polynomials , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[42]  Ketan Mulmuley,et al.  Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems , 2002, SIAM J. Comput..

[43]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[44]  Shachar Lovett.  Computing Polynomials with Few Multiplications , 2011, Theory Comput..

[45]  J. Oxley.  Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .

[46]  Zeev Dvir,et al.  Guest column: from randomness extraction to rotating needles , 2010, SIGA.

[47]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[48]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[49]  Michael Soltys.  BERKOWITZ'S ALGORITHM AND CLOW SEQUENCES ∗ , 2002 .

[50]  David Wright,et al.  On the Jacobian conjecture , 1981 .

[51]  Jin-Yi Cai,et al.  A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2 , 2008, STOC '08.

[52]  James G. Oxley,et al.  Matroid theory , 1992 .

[53]  Amir Shpilka,et al.  Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in , 2007, Electron. Colloquium Comput. Complex..

[54]  Amir Yehudayoff,et al.  Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..

[55]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

[56]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[57]  Ketan Mulmuley,et al.  On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis , 2009, ArXiv.

[58]  Zhi-Zhong Chen,et al.  Reducing randomness via irrational numbers , 1997, STOC '97.

[59]  Joachim von zur Gathen.  Permanent and determinant , 1987 .

[60]  Nisheeth K. Vishnoi,et al.  Deterministically testing sparse polynomial identities of unbounded degree , 2009, Inf. Process. Lett..

[61]  Avi Wigderson,et al.  Depth-3 arithmetic formulae over fields of characteristic zero , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[62]  Neeraj Kayal,et al.  Polynomial Identity Testing for Depth 3 Circuits , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[63]  Richard Zippel,et al.  Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..

[64]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[65]  Zeev Dvir,et al.  On the size of Kakeya sets in finite fields , 2008, 0803.2336.

[66]  Jie-Tai Yu.  On the Jacobian Conjecture: Reduction of Coefficients , 1995 .

[67]  A. Yehudayoff,et al.  Arithmetic complexity in algebraic extensions , 2009 .

[68]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[69]  Russell Impagliazzo,et al.  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.

[70]  D. R. Heath-Brown.  An estimate for Heilbronn's exponential sum , 1996 .

[71]  Wolfgang M. Schmidt,et al.  Equations over Finite Fields: An Elementary Approach , 1976 .

[72]  P. Olver.  Classical Invariant Theory , 1999 .

[73]  Trevor D. Wooley,et al.  A note on simultaneous congruences , 1996 .

[74]  D. Hilbert,et al.  Theory of algebraic invariants , 1993 .

[75]  W. J. Ellison.  A `Waring's problem' for homogeneous forms , 1969 .

[76]  T. Mignon,et al.  A quadratic bound for the determinant and permanent problem , 2004 .

[77]  H. L. Dorwart.  Irreducibility of Polynomials , 1935 .

[78]  O. Keller,et al.  Ganze Cremona-Transformationen , 1939 .

[79]  V. Strassen.  Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten , 1973 .

[80]  Stuart J. Berkowitz,et al.  On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..

[81]  Andrew Drucker.  Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009 , 2009, Computational Complexity Conference.

[82]  Ran Raz,et al.  Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[83]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[84]  Shuhong Gao,et al.  Factoring multivariate polynomials via partial differential equations , 2003, Math. Comput..

[85]  Erich Kaltofen,et al.  Factorization of Polynomials Given by Straight-Line Programs , 1989, Adv. Comput. Res..

[86]  Avi Wigderson,et al.  Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.

[87]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[88]  Nitin Saxena,et al.  Diagonal Circuit Identity Testing and Lower Bounds , 2008, ICALP.

[89]  Jin-Yi Cai.  A Note on the Determinant and Permanent Problem , 1990, Inf. Comput..

[90]  Ketan Mulmuley,et al.  On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier , 2009, ArXiv.

[91]  R. Meshulam.  On two extremal matrix problems , 1989 .

[92]  Hofreiter.  Moderne Algebra , 1941 .

[93]  Zeev Dvir,et al.  From Randomness Extraction to Rotating Needles , 2009, Electron. Colloquium Comput. Complex..

[94]  Shubhangi Saraf,et al.  Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[95]  Avi Wigderson,et al.  Algebrization: A New Barrier in Complexity Theory , 2009, TOCT.

[96]  Walter Baur,et al.  The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..

[97]  Nitin Saxena,et al.  Equivalence of F-Algebras and Cubic Forms , 2006, STACS.