Torus polynomials: an algebraic approach to ACC lower bounds

We propose an algebraic approach to proving circuit lower bounds for ACC0 by defining and studying the notion of torus polynomials. We show how currently known polynomial-based approximation results for AC0 and ACC0 can be reformulated in this framework, implying that ACC0 can be approximated by low-degree torus polynomials. Furthermore, as a step towards proving ACC0 lower bounds for the majority function via our approach, we show that MAJORITY cannot be approximated by low-degree symmetric torus polynomials. We also pose several open problems related to our framework.

[1]  Prahladh Harsha,et al.  On polynomial approximations over Z/2kZ , 2017, STACS.

[2]  Johan Hå stad.  The Shrinkage Exponent of de Morgan Formulas is 2 , 1998 .

[3]  Johan Håstad.  The Shrinkage Exponent of de Morgan Formulas is 2 , 1998, SIAM J. Comput..

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

[5]  Richard Beigel,et al.  On ACC (circuit complexity) , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[6]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[7]  Terence Tao,et al.  The Inverse Conjecture for the Gowers Norm over Finite Fields in Low Characteristic , 2011, 1101.1469.

[8]  Jacobo Torán,et al.  The power of the middle bit , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[9]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

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

[11]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[12]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[13]  Shachar Lovett,et al.  Nonclassical polynomials as a barrier to polynomial lower bounds , 2014, Electron. Colloquium Comput. Complex..

[14]  Cody Murray,et al.  Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP , 2018, Electron. Colloquium Comput. Complex..

[15]  Shachar Lovett,et al.  Every locally characterized affine-invariant property is testable , 2013, STOC '13.

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