Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > KAAVE HOSSEINI:
All reports by Author Kaave Hosseini:

TR23-203 | 15th December 2023
Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni

Refuting approaches to the log-rank conjecture for XOR functions

The log-rank conjecture, a longstanding problem in communication complexity, has persistently eluded resolution for decades. Consequently, some recent efforts have focused on potential approaches for establishing the conjecture in the special case of XOR functions, where the communication matrix is lifted from a boolean function, and the rank of ... more >>>




ISSN 1433-8092 | Imprint