Abstract
We prove that any total boolean function of rank r can be computed by a deterministic communication protocol of complexity O (√ ċ log( r )). Equivalently, any graph whose adjacency matrix has rank r has chromatic number at most 2 O (√ r ċlog( r )) . This gives a nearly quadratic improvement in the dependence on the rank over previous results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
