Communication lower bounds via critical block sensitivity

@article{Gs2014CommunicationLB,
  title={Communication lower bounds via critical block sensitivity},
  author={Mika G{\"o}{\"o}s and T. Pitassi},
  journal={Proceedings of the forty-sixth annual ACM symposium on Theory of computing},
  year={2014}
}
  • Mika Göös, T. Pitassi
  • Published 2014
  • Mathematics, Computer Science
  • Proceedings of the forty-sixth annual ACM symposium on Theory of computing
  • We use critical block sensitivity, a new complexity measure introduced by Huynh and Nordström (STOC 2012), to study the communication complexity of search problems. To begin, we give a simple new proof of the following central result of Huynh and Nordström: if S is a search problem with critical block sensitivity b, then every randomised two-party protocol solving a certain two-party lift of S requires Ω(b) bits of communication. Besides simplicity, our proof has the advantage of generalising… CONTINUE READING
    61 Citations
    Simulation beats richness: new data-structure lower bounds
    • 13
    On the Communication Complexity of Approximate Fixed Points
    • T. Roughgarden, O. Weinstein
    • Mathematics, Computer Science
    • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2016
    • 22
    • PDF
    Correlation Bounds Against Monotone NC^1
    • B. Rossman
    • Mathematics, Computer Science
    • Computational Complexity Conference
    • 2015
    • 13
    • PDF
    Communication Lower Bounds via Query Complexity
    • 1
    • PDF
    How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
    • 40
    • Highly Influenced
    • PDF
    Simulation Theorems via Pseudo-random Properties
    • 26
    • PDF
    Unconditional Lower Bounds in Complexity Theory
    • 10
    On Query-to-Communication Lifting for Adversary Bounds
    • PDF
    Exponential Lower Bounds for Monotone Span Programs
    • 56
    • PDF
    Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
    • 8
    • PDF

    References

    SHOWING 1-10 OF 14 REFERENCES
    On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity
    • 54
    • Highly Influential
    • PDF
    Separation of the Monotone NC Hierarchy
    • 161
    • Highly Influential
    Communication Complexity of Simultaneous Messages
    • 65
    • Highly Influential
    • PDF
    Monotone circuits for connectivity require super-logarithmic depth
    • 335
    • Highly Influential
    • PDF
    Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
    • 54
    • Highly Influential
    • PDF
    On the Tightness of the Buhrman-Cleve-Wigderson Simulation
    • S. Zhang
    • Mathematics, Computer Science
    • ISAAC
    • 2009
    • 7
    • Highly Influential
    • PDF
    Pebble Games, Proof Complexity, and Time-Space Trade-offs
    • 32
    • Highly Influential
    • PDF
    Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
    • D. Grigoriev
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2001
    • 156
    • Highly Influential
    • PDF
    Monotone circuits for matching require linear depth
    • 105
    • Highly Influential
    • PDF
    Edmonds polytopes and a hierarchy of combinatorial problems
    • V. Chvátal
    • Computer Science, Mathematics
    • Discret. Math.
    • 1973
    • 592
    • Highly Influential