Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Log-rank conjecture
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/List_of_unsolved_problems_in_computer_science/QySnBJ5E">List of unsolved problems in computer science</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Lovász, László; Saks, Michael (1988), Möbius Functions and Communication Complexity, Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, pp. 81–90{{citation}}: CS1 maint: location missing publisher (link) <a href="/wiki/L%C3%A1szl%C3%B3_Lov%C3%A1sz" target="_blank">/wiki/L%C3%A1szl%C3%B3_Lov%C3%A1sz</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Lovett, Shachar (February 2014), "Recent advances on the log-rank conjecture in communication complexity", Bulletin of the EATCS, 112, arXiv:1403.8106 <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Lovett, Shachar (March 2016), "Communication is Bounded by Root of Rank", Journal of the ACM, 63 (1): 1:1–1:9, arXiv:1306.1877, doi:10.1145/2724704, S2CID 47394799 <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Sudakov, Benny; Tomon, Istvan (30 Nov 2023). "Matrix discrepancy and the log-rank conjecture". arXiv:2311.18524 [math]. <a href="/wiki/Benny_Sudakov" target="_blank">/wiki/Benny_Sudakov</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018), "Deterministic Communication vs. Partition Number", SIAM Journal on Computing, 47 (6): 2435–2450, doi:10.1137/16M1059369 <a href="/wiki/Toniann_Pitassi" target="_blank">/wiki/Toniann_Pitassi</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Chattopadhyay, Arkadev; Mande, Nikhil; Sherif, Suhail (2019), The Log-Approximate-Rank Conjecture is False, Annual ACM Symposium on the Theory of Computing, Phoenix, Arizona, USA{{citation}}: CS1 maint: location missing publisher (link) <a href="/wiki/Template:Citation" target="_blank">/wiki/Template:Citation</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> </ol>