11 search results - page 3 / 3 » Tighter Connections between Derandomization and Circuit Lowe... |
STOC
1991
ACM
13 years 9 months ago
1991
ACM
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...