Communication lower bounds via critical block sensitivity

DOI10.1145/2591796.2591838zbMath1315.68153arXiv1311.2355OpenAlexW2039681975MaRDI QIDQ5259621

Mika Göös, Toniann Pitassi

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://arxiv.org/abs/1311.2355

zbMATH Keywords

communication complexityproof complexitymonotone circuit depth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (19)

Narrow Proofs May Be Maximally Long ⋮ Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes ⋮ Cumulative Space in Black-White Pebbling and Resolution ⋮ Communication Lower Bounds via Critical Block Sensitivity ⋮ Dag-like communication and its applications ⋮ Space Complexity in Polynomial Calculus ⋮ Tight size-degree bounds for sums-of-squares proofs ⋮ Unnamed Item ⋮ Extension Complexity of Independent Set Polytopes ⋮ Conflict complexity is lower bounded by block sensitivity ⋮ Unnamed Item ⋮ Simulation theorems via pseudo-random properties ⋮ Negation-limited formulas ⋮ Unnamed Item ⋮ Adventures in monotone complexity and TFNP ⋮ Resolution over linear equations modulo two ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Reflections on Proof Complexity and Counting Principles

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

This page was built for publication: Communication lower bounds via critical block sensitivity