Abstract
This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems. © 1995 Akadémiai Kiadó.
Author supplied keywords
Cite
CITATION STYLE
APA
Nisan, N., & Wigderson, A. (1995). On rank vs. communication complexity. Combinatorica, 15(4), 557–565. https://doi.org/10.1007/BF01192527
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free