The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk)

In circuit complexity, the polynomial method is a general approach to proving circuit lower bounds in restricted settings. One shows that functions computed by sufficiently restricted circuits are "correlated" in some way with a low-complexity polynomial, where complexity may be measured by the degree of the polynomial or the number of monomials. Then, results limiting the capabilities of low-complexity polynomials are extended to the restricted circuits. Old theorems proved by this method have recently found interesting applications to the design of algorithms for basic problems in the theory of computing. This paper surveys some of these applications, and gives a few new ones.

[1]  MansourYishay,et al.  Constant depth circuits, Fourier transform, and learnability , 1993 .

[2]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[3]  Fabrizio Grandoni,et al.  Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter , 2015, SODA.

[4]  Daniel A. Spielman,et al.  The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Ryan Williams,et al.  Finding orthogonal vectors in discrete structures , 2014, SODA.

[6]  Russell Impagliazzo,et al.  A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[7]  Ryan Williams,et al.  New algorithms and lower bounds for circuits with linear threshold gates , 2014, STOC.

[8]  James Aspnes,et al.  The expressive power of voting polynomials , 1991, STOC '91.

[9]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[10]  Rocco A. Servedio,et al.  Learning and Lower Bounds for AC0 with Threshold Gates , 2010, APPROX-RANDOM.

[11]  Ryan O'Donnell,et al.  Learning functions of k relevant variables , 2004, J. Comput. Syst. Sci..

[12]  Yijie Han,et al.  Improved algorithm for all pairs shortest paths , 2004, Inf. Process. Lett..

[13]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[14]  Yishay Mansour,et al.  An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution , 1995, J. Comput. Syst. Sci..

[15]  Scott Aaronson.  The Polynomial Method in Quantum and Classical Computing , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Amir Abboud,et al.  Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[17]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[18]  Yijie Han,et al.  An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path , 2008, Algorithmica.

[19]  Uri Zwick,et al.  A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths , 2004, ISAAC.

[20]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[21]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[22]  Ryan Williams.  Nonuniform ACC Circuit Lower Bounds , 2014, JACM.

[23]  Russell Impagliazzo,et al.  The Complexity of Satisfiability of Small Depth Circuits , 2009, IWPEC.

[24]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[25]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[26]  Jun Tarui.  Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy , 1993, Theor. Comput. Sci..

[27]  Huacheng Yu,et al.  More Applications of the Polynomial Method to Algorithm Design , 2015, SODA.

[28]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[29]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[30]  Don Coppersmith.  Rapid Multiplication of Rectangular Matrices , 1982, SIAM J. Comput..

[31]  Timothy M. Chan.  More algorithms for all-pairs shortest paths in weighted graphs , 2007, STOC '07.

[32]  Richard M. Karp,et al.  Dynamic programming meets the principle of inclusion and exclusion , 1982, Oper. Res. Lett..

[33]  Ryan Williams,et al.  Faster all-pairs shortest paths via circuit complexity , 2013, STOC.

[34]  James Aspnes,et al.  The expressive power of voting polynomials , 1994, Comb..

[35]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[36]  Tadao Takaoka,et al.  A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem , 1991, Inf. Process. Lett..

[37]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[38]  Adam R. Klivans,et al.  Learning DNF in time 2 Õ(n 1/3 ) . , 2001, STOC 2001.

[39]  Tadao Takaoka,et al.  Subcubic Cost Algorithms for the All Pairs Shortest Path Problem , 1998, Algorithmica.

[40]  Swastik Kopparty,et al.  Certifying polynomials for AC^0(parity) circuits, with applications , 2012, FSTTCS.

[41]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[42]  Michael L. Fredman,et al.  New Bounds on the Complexity of the Shortest Path Problem , 1976, SIAM J. Comput..

[43]  Timothy M. Chan.  All-Pairs Shortest Paths with Real Weights in O(n3/log n) Time , 2008, Algorithmica.

[44]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[45]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[46]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

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

[48]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[49]  Tadao Takaoka,et al.  An O ( n 3 log log n / log n ) Time Algorithm for the All-Pairs Shortest Path Problem , 2004 .

[50]  Timothy M. Chan.  More Algorithms for All-Pairs Shortest Paths in Weighted Graphs , 2010, SIAM J. Comput..