On computation and communication with small bias

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 24-32

  Buhrman, Harry ^a   Vereshchagin, Nikolay ^b   De Wolf, Ronald ^c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; MATHEMATICAL MODELS; PROBABILITY; QUANTUM COMPUTERS;

COMMUNICATION COMPLEXITY; COMPUTATIONAL MODELS; ERROR PROBABILITIES; QUANTUM PROTOCOLS;

COMPUTATIONAL METHODS;

EID: 34748825757     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.18     Document Type: Conference Paper

References (33)

1. S. Aaronson. Quantum computing, postselection, and probabilistic polynomial-time. In Proceedings of the Royal Society, volume A461(2063), pages 3473-3482, 2005.
2. A. Aho, J. Ullman, and M. Yannakakis. Notions of information transfer in VLSI circuits. In Proceedings of 15th ACM STOC, pages 133-139, 1983.
3. E. Allender. A note on the power of threshold circuits. In Proceedings of 30th IEEE FOCS, pages 580-584, 1989.
4. N. Alon, P. Frankl, and V. Rödl. Geometrical realization of set systems and probabilistic communication complexity. In Proceedings of 26th FOCS, pages 277-280, 1985.
5. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14(2):1-14, 1994.
6. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proceedings of 27th IEEE FOCS, pages 337-347,1986.
7. R. Beigel. Perceptrons, PP, and the polynomial hierarchy. Computational Complexity, 4:339-349, 1994.
8. R. Beigel, N. Reingold, and D. Spielman. PP is closed under intersection. Journal of Computer and Systems Sciences, 50(2):191-202, 1995.
9. C. Damm, M. Krause, C. Meinel, and S. Waack. On relations between counting communication complexity classes. Journal of Computer and Systems Sciences, 69(2):259-280, 2004.
10. H. Ehlich and K. Zeller. Schwankung von Polynomen zwischen Gitterpunkten. Mathematische Zeitschrift, 86:41-44, 1964.
11. J. Forster. A linear lower bound on the unbounded error probabilistic communication complexity. In Proceedings of 16th IEEE Conference on Computational Complexity, pages 100-106, 2001.
12. L. Fortnow and N. Reingold. PP is closed under truth-table reductions. Information and Computation, 124(1):l-6, 1996.
13. B. Halstenberg and R. Reischuk. Relations between communication complexity classes. Journal of Computer and Systems Sciences, 41(3):402-429, 1990.
14. B. Halstenberg and R. Reischuk. Different modes of communication. SIAM Journal on Computing, 22(5):913-934, 1993.
15. J. Håstad. On the size of weights for threshold gates. SIAM Journal on Discrete Mathematics, 7(3):484-492, 1994.
16. M. Karchmer, I. Newman, M. Saks, and A. Wigderson. Non-deterministic communication complexity with few witnesses. Journal of Computer and Systems Sciences, 49(2): 247-257, 1994. Earlier version in Structures'92.
17. H. Klauck. Lower bounds for quantum communication complexity. In Proceedings of 42nd IEEE FOCS, pages 288-297, 2001.
18. H. Klauck, R. Špalek, and R. de Wolf. Quantum and classical strong direct product theorems and optimal time-space tradeoffs. In Proceedings of 45th IEEE FOCS, pages 12-21, 2004.
19. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
20. N. Linial, S. Mendelson, G. Schechtman, and A. Shraibman. Complexity measures of sign matrices. Combinatorica, 2006. To appear.
21. N. Linial and A. Shraibman. Learning complexity vs. communication complexity. Manuscript available at Linial's homepage, 2006.
22. N. Linial and A. Shraibman. Lower bounds in communication complexity based on factorization norms. In Proceedings of 39th ACM STOC, 2007.
23. S. Lokam. Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. Journal of Computer and Systems Sciences, 63(3):449-473, 2001. Earlier version in FOCS'95.
24. S. Muroga. Threshold logic and its applications. Wiley-Interscience, 1971.
25. R. O'Donnell and R. Servedio. Extremal properties of polynomial threshold functions. In Proceedings of 18th IEEE Conference on Computational Complexity, pages 3-12, 2003.
26. R. Paturi and J. Simon. Probabilistic communication complexity. Journal of Computer and Systems Sciences, 33(1):106-123, 1986. Earlier version in FOCS'84.
27. V. Podolski. Personal communication, unpublished manuscript. 2007.
28. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya of the Russian Academy of Sciences, mathematics, 67(1):159-176, 2003.
29. T. J. Rivlin and E. W. Cheney. A comparison of uniform approximations on an interval and a finite subset thereof. SIAM Journal on Numerical Analysis, 3(2):311-320, 1966.
30. R. Servedio. Every linear threshold function has a low-weight approximator. In Proceedings of 21st IEEE Conference on Computational Complexity, pages 18-32, 2006.
31. A. Sherstov. Halfspace matrices. In Proceedings of 22nd IEEE Conference on Computational Complexity, 2007.
32. 0 from depth-2 majority circuits. In Proceedings of 39th ACM STOC, 2007.
33. A. C-C. Yao. Some complexity questions related to distributive computing. In Proceedings of 11th ACM STOC, pages 209-213, 1979.