2 citations · 4 across the 8 of their papers we have counts for
1 paper · 1 filter
Mark Braverman, Jon Schneider
The information complexity of a function f is the minimum amount of information Alice and Bob need to exchange to compute the function f. In this paper we provide an algorithm…