2 - Rank
from Part I - Communication
Published online by Cambridge University Press: 30 January 2020
Summary
Using matrix rank to prove lower bounds oncommunication complexity. Using the structure oflow-rank Boolean matrices to deduce efficientprotocols.
Keywords
- Type
- Chapter
- Information
- Communication Complexityand Applications, pp. 33 - 45Publisher: Cambridge University PressPrint publication year: 2020