• Mathematics, Computer Science
  • Published in
    23rd Annual IEEE Conference…
    2008
  • DOI:10.1109/ccc.2008.25

A Direct Product Theorem for Discrepancy

@article{Lee2008ADP,
  title={A Direct Product Theorem for Discrepancy},
  author={Troy Lee and Adi Shraibman and Robert Spalek},
  journal={2008 23rd Annual IEEE Conference on Computational Complexity},
  year={2008},
  pages={71-80}
}
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 direct product theorem for distributional complexity, and direct sum theorems for worst-case complexity, for bounds shown by the discrepancy… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 50 CITATIONS

FILTER CITATIONS BY YEAR

2007
2019

CITATION STATISTICS

  • 3 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 29 REFERENCES

Towards proving strong direct product theorems

  • computational complexity
  • 2001
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Lovász . On the Shannon capacity of a graph

L.
  • IEEE Transactions on Information Theory
  • 2007

Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols

  • Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
  • 2007

Shraibman . Lower bounds in communication complexity based on factorization norms

A.
  • 2007