Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas

DOI10.1145/2591796.2591823zbMath1315.68139OpenAlexW1964748897MaRDI QIDQ5259545

Chandan Saha, Nutan Limaye, Neeraj Kayal, Srikanth Srinivasan

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.2591823

zbMATH Keywords

lower boundsarithmetic circuitsshifted partial derivatives

Mathematics Subject Classification ID

Numerical computation of determinants (65F40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Lower bounds for depth-three arithmetic circuits with small bottom fanin, On the limits of depth reduction at depth 3 over small finite fields, Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication, An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas, Barriers for Rank Methods in Arithmetic Complexity, The Computational Power of Depth Five Arithmetic Circuits, Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography