Breaking the Minsky-Papert barrier for constant-depth circuits

DOI10.1145/2591796.2591871MaRDI QIDQ5259556zbMATH OpenOpenAlexFDO

Authors Alexander A. Sherstov

Publication date 26 June 2015

Published in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2591796.2591871

zbMATH Keywords

polynomial approximationcommunication complexitycomputational learning theorypolynomial threshold functionspolynomial representations of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
• The power of asymmetry in constant-depth circuits
• New degree bounds for polynomial threshold functions
• New degree bounds for polynomial threshold functions
• Near-optimal lower bounds on the threshold degree and sign-rank of \(\mathrm{AC}^0\)

Cites work

• scientific article; zbMATH DE number 5485440 (Why is no real title available?)
• scientific article; zbMATH DE number 5485574 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Bounds on the sample complexity for private learning and private data release
• Characterizing the sample complexity of private learners
• Collusion-secure fingerprinting for digital data
• Differential privacy and the fat-shattering dimension of linear queries
• Efficient algorithms for privately releasing marginals via convex relaxations
• Faster algorithms for privately releasing marginals
• Faster private release of marginals on small databases
• Interactive privacy via the median mechanism
• Iterative Constructions and Private Data Release
• Lower bounds in differential privacy
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• On the complexity of differentially private data release, efficient algorithms and hardness results
• On the geometry of differential privacy
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Theory of Cryptography

Cited in

(9)

• Approximate degree and the complexity of depth three circuits
• On the power of statistical zero knowledge
• The power of asymmetry in constant-depth circuits
• A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
• The large-error approximate degree of \(\mathrm{AC}^0\)
• Hardness amplification and the approximate degree of constant-depth circuits
• Dual polynomials for collision and element distinctness
• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
• Parity, circuits, and the polynomial-time hierarchy

Describes a project that uses

Uses Software

• SuLQ

This page was built for publication: Breaking the Minsky-Papert barrier for constant-depth circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259556)