Document Open Access Logo

Communication Complexity and Discrepancy of Halfplanes

Authors Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2024.5.pdf
  • Filesize: 0.83 MB
  • 17 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Communication complexity
Keywords
  • Randomized communication complexity
  • Discrepancy theory
  • factorization norm

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We study the discrepancy of the following communication problem. Alice receives a halfplane, and Bob receives a point in the plane, and their goal is to determine whether Bob’s point belongs to Alice’s halfplane. This communication task corresponds to determining whether x₁y₁+y₂ ≥ x₂, where the first player knows (x₁,x₂) and the second player knows (y₁,y₂). 
Denoting n = m³, we show that when the inputs are chosen from [m] × [m²], the communication discrepancy of the above problem is O(n^{-1/6} log^{3/2} n).
On the other hand, through the connections to the notion of hereditary discrepancy by Matoušek, Nikolov, and Tawler (IMRN 2020) and a classical result of Matoušek (Discrete Comput. Geom. 1995), we show that the communication discrepancy of every set of n points and n halfplanes is at least Ω(n^{-1/4} log^{-1} n).

Cite As Get BibTex

Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, and Kusha Sareen. Communication Complexity and Discrepancy of Halfplanes. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.SoCG.2024.5

Author Details

Manasseh Ahmed
  • Marianopolis College, Montreal, Canada
Tsun-Ming Cheung
  • School of Computer Science, McGill University, Montreal, Canada
Hamed Hatami
  • School of Computer Science, McGill University, Montreal, Canada
Kusha Sareen
  • School of Computer Science, McGill University, Montreal, Canada

Funding

  • Hatami, Hamed: Supported by an NSERC grant.

Acknowledgements

We wish to thank an anonymous reviewer for pointing out a possible modification in the proof of Proposition 5, which improves the resultant bound.

References

  1. Pankaj K. Agarwal. Range searching. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, Second Edition, pages 809-837. Chapman and Hall/CRC, 2004. URL: https://doi.org/10.1201/9781420035315.CH36.
  2. Noga Alon, János Pach, Rom Pinchasi, Radoš Radoičić, and Micha Sharir. Crossing patterns of semi-algebraic sets. Journal of Combinatorial Theory, Series A, 111(2):310-326, 2005. Google Scholar
  3. László Babai, Peter Frankl, and Janos Simon. Complexity classes in communication complexity theory. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pages 337-347. IEEE, 1986. Google Scholar
  4. Mark Braverman and Omri Weinstein. A discrepancy lower bound for information complexity. Algorithmica, 76(3):846-864, 2016. Google Scholar
  5. Harry Buhrman, Nikolay Vereshchagin, and Ronald de Wolf. On computation and communication with small bias. In Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pages 24-32. IEEE, 2007. Google Scholar
  6. Bernard Chazelle. The Discrepancy Method: Randomness and Complexity. Cambridge University Press, July 2000. URL: https://doi.org/10.1017/cbo9780511626371.
  7. Bernard Chazelle and Alexey Lvov. A trace bound for the hereditary discrepancy. Discrete & Computational Geometry, 26:221-231, 2000. URL: https://api.semanticscholar.org/CorpusID:6272661.
  8. Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, 1988. Google Scholar
  9. Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, and Rosie Zhao. Lower bound methods for sign-rank and their limitations. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), volume 245 of Leibniz International Proceedings in Informatics (LIPIcs), pages 22:1-22:24, 2022. Google Scholar
  10. Hamed Hatami, Kaave Hosseini, and Shachar Lovett. Sign-rank vs. discrepancy. Theory Comput., 18:Paper No. 19, 22, 2022. Google Scholar
  11. Ilan Kremer, Noam Nisan, and Dana Ron. On randomized one-round communication complexity. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC '95, pages 596-605, New York, NY, USA, 1995. Association for Computing Machinery. URL: https://doi.org/10.1145/225058.225277.
  12. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997. Google Scholar
  13. Troy Lee, Adi Shraibman, and Robert Špalek. A direct product theorem for discrepancy. In 2008 23rd Annual IEEE Conference on Computational Complexity, pages 71-80, 2008. URL: https://doi.org/10.1109/CCC.2008.25.
  14. Nati Linial, Shahar Mendelson, Gideon Schechtman, and Adi Shraibman. Complexity measures of sign matrices. Combinatorica, 27(4):439-463, 2007. Google Scholar
  15. Nati Linial and Adi Shraibman. Learning complexity vs. communication complexity. Combin. Probab. Comput., 18(1-2):227-245, 2009. Google Scholar
  16. Nati Linial and Adi Shraibman. Lower bounds in communication complexity based on factorization norms. Random Structures & Algorithms, 34(3):368-394, 2009. Google Scholar
  17. L. Lovász, J. Spencer, and K. Vesztergombi. Discrepancy of set-systems and matrices. European Journal of Combinatorics, 7(2):151-160, April 1986. URL: https://doi.org/10.1016/s0195-6698(86)80041-5.
  18. Jiří Matoušek. Geometric Discrepancy. Springer Berlin Heidelberg, 1999. URL: https://doi.org/10.1007/978-3-642-03942-3.
  19. Jiří Matoušek, Aleksandar Nikolov, and Kunal Talwar. Factorization norms and hereditary discrepancy, 2015. URL: https://arxiv.org/abs/1408.1376.
  20. Jiří Matoušek. Tight upper bounds for the discrepancy of half-spaces. Discrete & Computational Geometry, 13:593-601, 1995. URL: https://api.semanticscholar.org/CorpusID:39430935.
  21. N. Nisan. The communication complexity of threshold gates. In Combinatorics, Paul Erdős is eighty, Vol. 1, Bolyai Soc. Math. Stud., pages 301-315. János Bolyai Math. Soc., Budapest, 1993. Google Scholar
  22. Ramamohan Paturi and Janos Simon. Probabilistic communication complexity. Journal of Computer and System Sciences, 33(1):106-123, 1986. Google Scholar
  23. Alexander A. Sherstov. Communication complexity under product and nonproduct distributions. In 2008 23rd Annual IEEE Conference on Computational Complexity, pages 64-70, 2008. URL: https://doi.org/10.1109/CCC.2008.10.
  24. Alexander A Sherstov. Halfspace matrices. Computational Complexity, 17(2):149-178, 2008. Google Scholar
  25. Alexander A Sherstov. The pattern matrix method. SIAM Journal on Computing, 40(6):1969-2000, 2011. Google Scholar
  26. Alexander A Sherstov. Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. Combinatorica, 33(1):73-96, 2013. Google Scholar
  27. Alexander A. Sherstov. The hardest halfspace. CoRR, abs/1902.01765, 2019. URL: https://arxiv.org/abs/1902.01765.
  28. Justin Thaler. Lower bounds for the approximate degree of block-composed functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  29. Andrew C. Yao. Lower bounds by probabilistic arguments. In 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pages 420-428, 1983. URL: https://doi.org/10.1109/SFCS.1983.30.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact