Skip to main content
Communication is bounded by root of rank
Published Web Location
https://arxiv.org/pdf/1306.1877.pdfNo data is associated with this publication.
Abstract
We prove that any total boolean function of rank r can be computed by a deterministic communication protocol of complexity O(√r · log(r)). Similarly, any graph whose adjacency matrix has rank r has chromatic number at most 2O(√r·log(r)). This gives a nearly quadratic improvement in the dependence on the rank over previous results. © 2014 ACM.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.