The Corruption Bound, Log Rank, and Communication Complexity
published by Adi Shraibman
in 2014
in Informatics Engineering
and research's language is
English
Download
Abstract in English
We prove upper bounds on deterministic communication complexity in terms of log of the rank and simp
Download