research-article

Breaking the minsky-papert barrier for constant-depth circuits

Author:

Alexander A. SherstovAuthors Info & Claims

STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

Pages 223 - 232

https://doi.org/10.1145/2591796.2591871

Published: 31 May 2014 Publication History

Abstract

The threshold degree of a Boolean function f is the minimum degree of a real polynomial p that represents f in sign: f(x) ≡ sgn p(x). In a seminal 1969 monograph, Minsky and Papert constructed a polynomial-size constant-depth {∧, ∨)-circuit in n variables with threshold degree Ω(n^1/3). This bound underlies some of today's strongest results on constant-depth circuits. It has been an open problem (O'Donnell and Servedio, STOC 2003) to improve Minsky and Papert's bound to n^Ω(1)+1/3.

We give a detailed solution to this problem. For any fixed k ≥ 1, we construct an {∧, ∨)-formula of size n and depth k with threshold degree Ω(n k-1/2k-1). This lower bound nearly matches a known O(√n) bound for arbitrary formulas, and is exactly tight for regular formulas. Our result proves a conjecture due to O'Donnell and Servedio (STOC 2003) and a different conjecture due to Bun and Thaler (2013). Applications to communication complexity and computational learning are given.

Supplementary Material

MP4 File (p223-sidebyside.mp4)

Download
227.52 MB

References

[1]

S. Aaronson and Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. J. ACM, 51(4):595--605, 2004.

Digital Library

[2]

A. Ambainis. Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range. Theory of Computing, 1(1):37--46, 2005.

[3]

A. Ambainis, A. M. Childs, B. Reichardt, R. Špalek, and S. Zhang. Any AND-OR formula of size N can be evaluated in time N^1/2+o(1) on a quantum computer. In Proceedings of the Forty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 363--372, 2007.

Digital Library

[4]

J. Aspnes, R. Beigel, M. L. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14(2):135--148, 1994.

[5]

L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proceedings of the Twenty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 337--347, 1986.

Digital Library

[6]

P. Beame and D.-T. Huynh-Ngoc. Multiparty communication complexity and threshold circuit complexity of AC⁰. In Proceedings of the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 53--62, 2009.

Digital Library

[7]

R. Beigel, N. Reingold, and D. A. Spielman. PP is closed under intersection. J. Comput. Syst. Sci., 50(2):191--202, 1995.

Digital Library

[8]

H. Buhrman, N. K. Vereshchagin, and R. de Wolf. On computation and communication with small bias. In Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (CCC), pages 24--32, 2007.

Digital Library

[9]

M. Bun and J. Thaler. Dual lower bounds for approximate degree and Markov-Bernstein inequalities. In Proceedings of the Fortieth International Colloquium on Automata, Languages and Programming (ICALP), pages 303--314, 2013.

Digital Library

[10]

M. Bun and J. Thaler. Hardness amplification and the approximate degree of constant-depth circuits. In Electronic Colloquium on Computational Complexity (ECCC), 2013. Report TR13-151.

[11]

A. Chattopadhyay and A. Ada. Multiparty communication complexity of disjointness. In Electronic Colloquium on Computational Complexity (ECCC), January 2008. Report TR08-002.

[12]

E. Farhi, J. Goldstone, and S. Gutmann. A quantum algorithm for the Hamiltonian NAND tree. Theory of Computing, 4(1):169--190, 2008.

[13]

D. Gavinsky and A. A. Sherstov. A separation of NP and coNP in multiparty communication complexity. Theory of Computing, 6(10):227--245, 2010.

[14]

A. R. Klivans and R. A. Servedio. Learning DNF in time 2^{O(n^1/3)}. J. Comput. Syst. Sci., 68(2):303--318, 2004.

Digital Library

[15]

M. Krause and P. Pudlák. On the computational power of depth-2 circuits with threshold and modulo gates. Theor. Comput. Sci., 174(1--2):137--156, 1997.

Digital Library

[16]

M. Krause and P. Pudlák. Computing Boolean functions by polynomials and threshold circuits. Comput. Complex., 7(4):346--370, 1998.

Digital Library

[17]

T. Lee. A note on the sign degree of formulas, 2009. Available at http://arxiv.org/abs/0909.4607.

[18]

M. L. Minsky and S. A. Papert. Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge, Mass., 1969.

Digital Library

[19]

N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. Computational Complexity, 4:301--313, 1994.

Digital Library

[20]

R. O'Donnell and R. A. Servedio. New degree bounds for polynomial threshold functions. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pages 325--334, 2003.

Digital Library

[21]

R. Paturi and M. E. Saks. Approximating threshold circuits by rational functions. Inf. Comput., 112(2):257--272, 1994.

Digital Library

[22]

V. V. Podolskii. Perceptrons of large weight. In Proc. of the Second International Computer Science Symposium in Russia (CSR), pages 328--336, 2007.

Digital Library

[23]

V. V. Podolskii. A uniform lower bound on weights of perceptrons. In Proc. of the Third International Computer Science Symposium in Russia (CSR), pages 261--272, 2008.

Digital Library

[24]

A. A. Razborov and A. A. Sherstov. The sign-rank of AC⁰. SIAM J. Comput., 39(5):1833--1855, 2010. Preliminary version in Proceedings of the Forty-Ninth Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008.

Digital Library

[25]

A. A. Sherstov. The intersection of two halfspaces has high threshold degree. In Proceedings of the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 343--362, 2009.

Digital Library

[26]

A. A. Sherstov. Separating AC⁰ from depth-2 majority circuits. SIAM J. Comput., 38(6):2113--2129, 2009. Preliminary version in Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (STOC), 2007.

Digital Library

[27]

A. A. Sherstov. Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. In Proceedings of the Forty-Second Annual ACM Symposium on Theory of Computing (STOC), pages 523--532, 2010.

Digital Library

[28]

A. A. Sherstov. The pattern matrix method. SIAM J. Comput., 40(6):1969--2000, 2011. Preliminary version in Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC), 2008.

Digital Library

[29]

A. A. Sherstov. Making polynomials robust to noise. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC), pages 747--757, 2012.

Digital Library

[30]

A. A. Sherstov. The multiparty communication complexity of set disjointness. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC), pages 525--544, 2012.

Digital Library

[31]

A. A. Sherstov. Strong direct product theorems for quantum communication and query complexity. SIAM J. Comput., 41(5):1122--1165, 2012. Preliminary version in Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing (STOC), 2011.

Digital Library

[32]

A. A. Sherstov. Approximating the AND-OR tree. Theory of Computing, 9(20):653--663, 2013.

[33]

A. A. Sherstov. Communication lower bounds using directional derivatives. In Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pages 921--930, 2013.

Digital Library

[34]

A. A. Sherstov. Breaking the Minsky-Papert barrier for constant-depth circuits. In Electronic Colloquium on Computational Complexity (ECCC), 2014. Report TR14-009.

Digital Library

[35]

K.-Y. Siu, V. P. Roychowdhury, and T. Kailath. Rational approximation techniques for analysis of neural networks. IEEE Transactions on Information Theory, 40(2):455--466, 1994.

Digital Library

Cited By

Bun MKothari RThaler JDiakonikolas IKempe DHenzinger M(2018)The polynomial method strikes back: tight quantum query bounds via dual polynomialsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188784(297-310)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188784
Bouland AChen LHolden DThaler JVasudevan P(2017)On the Power of Statistical Zero Knowledge2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2017.71(708-719)Online publication date: Oct-2017
https://doi.org/10.1109/FOCS.2017.71
Bun MThaler J(2017)A Nearly Optimal Lower Bound on the Approximate Degree of AC^02017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2017.10(1-12)Online publication date: Oct-2017
https://doi.org/10.1109/FOCS.2017.10
Show More Cited By

Index Terms

Breaking the minsky-papert barrier for constant-depth circuits
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes

Recommendations

Breaking the Minsky--Papert Barrier for Constant-Depth Circuits

The threshold degree of a Boolean function $f$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $f(x)\equiv {sgn}\ p(x)$. In a seminal 1969 monograph, Minsky and Papert constructed a polynomial-size constant-depth $\{\wedge,\vee\}$-...
The Power of Asymmetry in Constant-Depth Circuits

The threshold degree of a Boolean function $f$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $f(x)\equiv {sgn}~ p(x)$. Introduced in the seminal work of Minsky and Papert [Perceptrons: An Introduction to Computational Geometry, ...
Polynomial threshold functions and Boolean threshold circuits

We initiate a comprehensive study of the complexity of computing Boolean functions by polynomial threshold functions (PTFs) on general Boolean domains (as opposed to domains such as { 0 , 1 } n or { - 1 , 1 } n that enforce multilinearity). A typical ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing

May 2014

984 pages

ISBN:9781450327107

DOI:10.1145/2591796

Program Chair:
David Shmoys
Cornell University

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Division of Computing and Communication Foundations

Conference

STOC '14

Sponsor:

SIGACT

STOC '14: Symposium on Theory of Computing

May 31 - June 3, 2014

New York, New York

Acceptance Rates

STOC '14 Paper Acceptance Rate 91 of 319 submissions, 29%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
155
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bun MKothari RThaler JDiakonikolas IKempe DHenzinger M(2018)The polynomial method strikes back: tight quantum query bounds via dual polynomialsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188784(297-310)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188784
Bouland AChen LHolden DThaler JVasudevan P(2017)On the Power of Statistical Zero Knowledge2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2017.71(708-719)Online publication date: Oct-2017
https://doi.org/10.1109/FOCS.2017.71
Bun MThaler J(2017)A Nearly Optimal Lower Bound on the Approximate Degree of AC^02017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2017.10(1-12)Online publication date: Oct-2017
https://doi.org/10.1109/FOCS.2017.10
Göös MJayram T(2016)A composition theorem for conical juntasProceedings of the 31st Conference on Computational Complexity10.5555/2982445.2982450(1-16)Online publication date: 29-May-2016
https://dl.acm.org/doi/10.5555/2982445.2982450
Alman JChan TWilliams R(2016)Polynomial Representations of Threshold Functions and Algorithmic Applications2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2016.57(467-476)Online publication date: Oct-2016
https://doi.org/10.1109/FOCS.2016.57
Bun MThaler J(2015)Hardness Amplification and the Approximate Degree of Constant-Depth CircuitsAutomata, Languages, and Programming10.1007/978-3-662-47672-7_22(268-280)Online publication date: 20-Jun-2015
https://doi.org/10.1007/978-3-662-47672-7_22

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents