The Corruption Bound, Log Rank, and Communication Complexity

We prove upper bounds on deterministic communication complexity in terms of log of the rank and simp