communication complexity (indexing, gap hamming) + application to median and F0 lower bounds
Prev: amnesic-dynamic-programming-approximate-distance-to-monotonicity Next: randomized-and-approximate-f0-lower-bounds-disjointness-fp-lower-bound-dimensionality-reduction-jl-lemma
Prev: amnesic-dynamic-programming-approximate-distance-to-monotonicity Next: randomized-and-approximate-f0-lower-bounds-disjointness-fp-lower-bound-dimensionality-reduction-jl-lemma