Sciweavers

STOC
1991
ACM
93views Algorithms» more  STOC 1991»
14 years 4 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson