Hamed Hatami
Skip Abstract Section
Abstract
Several theorems and conjectures in communication complexity state or speculate that the complexity of a matrix in a given communication model is controlled by a related analytic or algebraic matrix parameter, e.g., rank, sign-rank, discrepancy, etc. The forward direction is typically easy as the structural implications of small complexity often imply a bound on some matrix parameter. The challenge lies in establishing the reverse direction, which requires understanding the structure of Boolean matrices for which a given matrix parameter is small or large. We will discuss several research directions that align with this overarching theme.
- [ACHS23] Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, and Kusha Sareen. Communication complexity of half-plane membership. In Electron. Colloquium Comput. Complex., 2023.Google Scholar
- [AFR85] Noga Alon, Peter Frankl, and Vojtech R¨odl. Geometrical realization of set systems and probabilistic communication complexity. In 26th Annual Symposium on Foundations of Computer Science, FOCS 1985, pages 277--280. IEEE Computer Society, 1985.Google ScholarDigital Library
- [AMY16] Noga Alon, Shay Moran, and Amir Yehudayoff. Sign rank versus VC dimension. In Proceedings of the 29th Conference on Learning Theory, COLT 2016, volume 49, pages 47--80, 2016.Google Scholar
- [APP+05] Noga Alon, J´anos Pach, Rom Pinchasi, Rado's Radoici´c, and Micha Sharir. Crossing patterns of semi-algebraic sets. Journal of Combinatorial Theory, Series A, 111(2):310-- 326, 2005.Google ScholarDigital Library
- [AY22] Daniel Avraham and Amir Yehudayoff. On blocky ranks of matrices. Electron. Colloquium Comput. Complex., TR22--137, 2022.Google Scholar
- [BCK14] Abhishek Bhrushundi, Sourav Chakraborty, and Raghav Kulkarni. Property testing bounds for linear and quadratic functions via parity decision trees. In Computer science-theory and applications, volume 8476 of Lecture Notes in Comput. Sci., pages 97--110. Springer, Cham, 2014.Google ScholarCross Ref
- [BFS86] L´aszl´o Babai, P´eter 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 ScholarDigital Library
- [BVdW07] 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 ScholarDigital Library
- [Cha93] Bernard Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145--158, 1993.Google ScholarDigital Library
- [CHHS23] Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, and Morgan Shirley. Separation of the factorization norm and randomized communication complexity. In Proceedings, IEEE Conference on Computational Complexity (CCC), 2023.Google Scholar
- [CHZZ22] TsunMing Cheung, Hamed Hatami, Rosie Zhao, and Itai Zilberstein. Boolean functions with small approximate spectral norm. In Electronic Colloquium on Computational Complexity (ECCC), TR22-041, 2022.Google Scholar
- [CLV19] Arkadev Chattopadhyay, Shachar Lovett, and Marc Vinyals. Equality alone does not simulate randomness. In 34th Computational Complexity Conference (CCC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.Google Scholar
- [CMS19] Arkadev Chattopadhyay, Nikhil S. Mande, and Suhail Sherif. The log-approximaterank conjecture is false. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pages 42--53, New York, NY, USA, 2019. ACM.Google ScholarDigital Library
- [Coh60] Paul J. Cohen. On a conjecture of Littlewood and idempotent measures. Amer. J. Math., 82:191--212, 1960.Google ScholarCross Ref
- [CR12] Amit Chakrabarti and Oded Regev. An optimal lower bound on the communication complexity of gap-Hamming-distance. SIAM J. Comput., 41(5):1299--1317, 2012.Google ScholarDigital Library
- [DD07] Kenneth R. Davidson and Allan P. Donsig. Norms of Schur multipliers. Illinois J. Math., 51(3):743--766, 2007.Google ScholarCross Ref
- [DHP+22] Ben Davis, Hamed Hatami, William Pires, Ran Tao, and Hamza Usmani. On publiccoin zero-error randomized communication complexity. Information Processing Letters, 178:106293, 2022.Google ScholarDigital Library
- [EHK22] Louis Esperet, Nathaniel Harms, and Andrey Kupavskii. Sketching distances in monotone graph classes. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 1, 2022.Google Scholar
- [FF81] Peter Frankl and Zolt´an F¨uredi. A short proof for a theorem of harper about hammingspheres. Discrete Mathematics, 34(3):311--313, 1981.Google ScholarDigital Library
- [FPS16] Jacob Fox, J´anos Pach, and Andrew Suk. A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing. SIAM Journal on Computing, 45(6):2199--2223, 2016.Google ScholarDigital Library
- [GGMT23] W. T. Gowers, Ben Green, Freddie Manners, and Terence Tao. On a conjecture of Marton, 2023.Google Scholar
- [GKPW17] Mika G¨o¨os, Pritish Kamath, Toniann Pitassi, and Thomas Watson. Query-tocommunication lifting for PNP. 32nd Computational Complexity Conference, 79:Art. No. 12, 16, 2017.Google ScholarDigital Library
- [GPW18a] Mika G¨o¨os, Toniann Pitassi, and Thomas Watson. Deterministic communication vs. partition number. SIAM Journal on Computing, 47(6):2435--2450, 2018.Google ScholarDigital Library
- [GPW18b] Mika G¨o¨os, Toniann Pitassi, and Thomas Watson. The landscape of communication complexity classes. computational complexity, 27(2):245--304, 2018.Google Scholar
- [GS08] Ben Green and Tom Sanders. Boolean functions with small spectral norm. Geometric and Functional Analysis, 18(1):144--162, 2008.Google ScholarCross Ref
- [Har20] Nathaniel Harms. Universal communication, universal graphs, and graph labeling. In 11th Innovations in Theoretical Computer Science Conference, volume 151 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 33, 27. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2020. [HHH23] Lianna Hambardzumyan, Hamed Hatami, and Pooya Hatami. Dimension-free bounds and structural results in communication complexity. Israel Journal of Mathematics, 253(2):555--616, 2023.Google Scholar
- [HHL20] Hamed Hatami, Kaave Hosseini, and Shachar Lovett. Sign rank vs discrepancy. In 35th Computational Complexity Conference, volume 169 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 18, 14. 2020.Google Scholar
- [HHP+22] 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). Schloss Dagstuhl-Leibniz-Zentrum f¨ur Informatik, 2022.Google Scholar
- [HWZ22] Nathaniel Harms, Sebastian Wild, and Viktor Zamaraev. Randomized communication and implicit graph representations. In Proceedings, ACM Symposium on Theory of Computing (STOC), 2022.Google ScholarDigital Library
- [HZ24] Nathaniel Harms and Viktor Zamaraev. Randomized communication and implicit representations for matrices and graphs of small sign-rank. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024.Google ScholarCross Ref
- [IW10] Russell Impagliazzo and Ryan Williams. Communication complexity with synchronized clocks. In 2010 IEEE 25th Annual Conference on Computational Complexity, pages 259--269. IEEE, 2010.Google ScholarDigital Library
- [KN97] Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997.Google ScholarDigital Library
- [Liv95] Leo Livshits. A note on 0--1 Schur multipliers. Linear Algebra Appl., 222:15--22, 1995.Google ScholarCross Ref
- [LMSS07] Nati Linial, Shahar Mendelson, Gideon Schechtman, and Adi Shraibman. Complexity measures of sign matrices. Combinatorica, 27(4):439--463, 2007.Google ScholarDigital Library
- [Lov14] Shachar Lovett. Recent advances on the log-rank conjecture in communication complexity. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 112:18--35, 2014.Google Scholar
- [Lov16] Shachar Lovett. Communication is bounded by root of rank. Journal of the ACM (JACM), 63(1):1--9, 2016.Google Scholar
- [LS88] L´aszl´o Lov´asz and Michael Saks. Lattices, mobius functions and communications complexity. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pages 81--90. IEEE Computer Society, 1988.Google Scholar
- [LS09a] Nati Linial and Adi Shraibman. Learning complexity vs. communication complexity. Combin. Probab. Comput., 18(1--2):227--245, 2009.Google Scholar
- [LS09b] Nati Linial and Adi Shraibman. Lower bounds in communication complexity based on factorization norms. Random Structures & Algorithms, 34(3):368--394, 2009.Google ScholarDigital Library
- [LS23] Troy Lee and Adi Shraibman. Around the log-rank conjecture. Israel Journal of Mathematics, 256(2):441--477, 2023. [Mil64] J. Milnor. On the Betti numbers of real varieties. Proc. Amer. Math. Soc., 15:275--280, 1964.Google ScholarCross Ref
- [New91] Ilan Newman. Private vs. common random bits in communication complexity. Inf. Process. Lett., 39(2):67--71, July 1991.Google ScholarDigital Library
- [Nis93] Noam Nisan. The communication complexity of threshold gates. Combinatorics, 1:301--315, 1993.Google Scholar
- [NW95] Noam Nisan and Avi Wigderson. On rank vs. communication complexity. Combinatorica, 15(4):557--565, 1995.Google ScholarCross Ref
- [Pis96] Gilles Pisier. Similarity problems and completely bounded maps, volume 1618 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1996.Google ScholarCross Ref
- [PS86] Ramamohan Paturi and Janos Simon. Probabilistic communication complexity. Journal of Computer and System Sciences, 33(1):106--123, 1986.Google ScholarDigital Library
- [PSS23] Toniann Pitassi, Morgan Shirley, and Adi Shraibman. The strength of equality oracles in communication. In Proceedings, Innovations in Theoretical Computer Science (ITCS), 2023.Google Scholar
- [Raz92] A. A. Razborov. On the distributional complexity of disjointness. Theoret. Comput. Sci., 106(2):385--390, 1992.Google ScholarDigital Library
- [RS15] Sivaramakrishnan Natarajan Ramamoorthy and Makrand Sinha. On the communication complexity of greater-than. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 442--444. IEEE, 2015.Google ScholarDigital Library
- [RY20] Anup Rao and Amir Yehudayoff. Communication complexity and applications. Cambridge University Press, Cambridge, 2020.Google ScholarCross Ref
- [San11] Tom Sanders. A quantitative version of the non-abelian idempotent theorem. Geom. Funct. Anal., 21(1):141--221, 2011.Google ScholarCross Ref
- [San19] Tom Sanders. Boolean functions with small spectral norm, revisited. Mathematical Proceedings of the Cambridge Philosophical Society, 167(2):335--344, 2019.Google ScholarCross Ref
- [San20] Tom Sanders. Bounds in Cohen's idempotent theorem. Journal of Fourier Analysis and Applications, 26(2):1--64, 2020.Google ScholarCross Ref
- [She08] Alexander A Sherstov. Halfspace matrices. Computational Complexity, 17:149--178, 2008.Google ScholarDigital Library
- [She21] Alexander A. Sherstov. The hardest halfspace. Comput. Complexity, 30(2):Paper No. 11, 85, 2021.Google Scholar
- [ST23] Benny Sudakov and Istv´an Tomon. Matrix discrepancy and the log-rank conjecture. arXiv preprint arXiv:2311.18524, 2023. [Tho65] Ren´e Thom. Sur l'homologie des vari´et´es alg´ebriques r´eelles. In Differential and Combinatorial Topology (A Symposium in Honor of Marston Morse), pages 255--265. Princeton Univ. Press, Princeton, N.J., 1965.Google Scholar
- [Vio15] Emanuele Viola. The communication complexity of addition. Combinatorica, 35(6):703--747, 2015.Google ScholarDigital Library
- [War68] Hugh E. Warren. Lower bounds for approximation by nonlinear manifolds. Trans. Amer. Math. Soc., 133:167--178, 1968.Google ScholarCross Ref
- [Yao79] Andrew Chi-Chih Yao. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the eleventh annual ACM symposium on Theory of computing, pages 209--213, 1979.Google Scholar
- [Yao03] Andrew Chi-Chih Yao. On the power of quantum fingerprinting. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 77--81, 2003.Google Scholar
- [YY85] A C Yao and F F Yao. A general approach to d-dimensional geometric queries. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC '85, page 163--168. Association for Computing Machinery, 1985.Google ScholarDigital Library
Index Terms
- Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes
Index terms have been assigned to the content through auto-classification.
Recommendations
**-Matrix Arithmetics in Linear Complexity
For hierarchical matrices, approximations of the matrix-matrix sum and product can be computed in almost linear complexity, and using these matrix operations it is possible to construct the matrix inverse, efficient preconditioners based on approximate ...
Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR)
VLSID '14: Proceedings of the 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded SystemsQR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beam forming to wireless MIMO receivers. In this paper, we propose a novel Givens Rotation (GR) based QRD (GR-QRD) where we reduce the ...
Comments