A Direct Product Theorem for Discrepancy

Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in randomized, quantum, and even weakly-unbounded error models of communication. We show an optimal product theorem for discrepancy, namely that for any two Boolean functions f, g, disc(f odot g)=thetas(disc(f) disc(g)). As a consequence we obtain a strong… CONTINUE READING

Topics

Statistics

051015'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

84 Citations

Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.