The limits of depth reduction for arithmetic formulas
From MaRDI portal
Recommendations
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- An exponential lower bound for homogeneous depth four arithmetic formulas
- Computational depth and reducibility
- Computational depth and reducibility
- Size-Depth Tradeoffs for Algebraic Formulas
- Lower bounds on the depth of monotone arithmetic computations
- scientific article; zbMATH DE number 1256664
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
- Lower bounds for depth three arithmetic circuits with small bottom fanin
- scientific article; zbMATH DE number 1405642
Cites work
- 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
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- 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
(11)- Depth-4 lower bounds, determinantal complexity: a unified approach
- On the limits of depth reduction at depth 3 over small finite fields
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
- Lower bounds for depth-4 formulas computing iterated matrix multiplication
- An exponential lower bound for homogeneous depth four arithmetic formulas
- On the power of homogeneous depth 4 arithmetic circuits
- Lower bounds for sums of powers of low degree univariates
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- The computational power of depth five arithmetic circuits
- Lower bounds by Birkhoff interpolation
- Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
This page was built for publication: The limits of depth reduction for arithmetic formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259547)
