Lower bounds in communication complexity based on factorization norms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 699-708

  Linial, Nati ^a   Shraibman, Adi ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Communication complexity; Discrepancy; Factorization norms; Fourier analysis

Indexed keywords

BANACH SPACES; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; FOURIER ANALYSIS;

COMMUNICATION COMPLEXITY; DISCREPANCY; FACTORIZATION NORMS; QUANTUM COMMUNICATION;

QUANTUM THEORY;

EID: 35448987364     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250892     Document Type: Conference Paper

References (18)

1. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity. In Proceedings of the 27th IEEE FOCS, pages 337-347, 1986.
2. R. Bhatia. Matrix Analysis. Springer-Verlag, New York, 1997.
3. D. Gavinsky, J. Kempe, and R. de Wolf. Strength and weaknesses of quantum fingerprinting, 2006. accepted to CCC" 06.
4. V. Grolmusz. Harmonic analysis, real approximation, and the communication complexity of boolean functions. Algorithmica, 23(4):341-353, 1999.
5. G. J. O. Jameson. Summing and nuclear norms in Banach space theory. London mathematical society student texts. Cambridge university press, 1987.
6. H. Klauck. Lower bounds for quantum communication complexity. In Proceedings of the 42nd IEEE FOCS, pages 288-297, 2001.
7. I. Kremer. Quantum communication. In Master's thesis. Hebrew University of Jerusalem, 1995.
8. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. In Proceedings of the 35th IEEE FOCS, 1994.
9. E. Kushilevitz and N. Nisan. Communication Complexity. Cambride University Press, 1997.
10. N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman. Complexity measures of sign matrices. Combinatorica, to appear. Available at http://www.cs.huji.ac.il/-nati/PAPERS/complexity_matrices.ps.gz.
11. N. Linial and A. Shraibman. Learning complexity vs. communication complexity. Manuscript, 2006.
12. L. Lovasz and M. Saks. Latices, Mobius functions, and communication complexity. In Proceedings of the 29th IEEE FOCS, pages 81-90, 1988.
13. N. Nisan and A. Wigderson. On rank vs. communication complexity. In Proceedings of the 35th IEEE FOCS, pages 831-836, 1994.
14. G. Pisier. Factorization of linear operators and geometry of Banach spaces, volume 60 of CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, Washington, DC, 1986.
15. R. Raz. Fourier analysis for probabilistic communication complexity. Computational Complexity, 5(3/4):205-221, 1995.
16. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Science, Mathematics, 67:145-159, 2002.
17. A. Yao. Lower bounds by probabilistic arguments. In Proceedings of the 15th ACM STOC, pages 420-428, 1983.
18. A. Yao. Quantum circuit complexity. In Proceedings of the 84th IEEE FOCS, pages 352-361, 1993.