Hadamard tensors and lower bounds on multiparty communication complexity

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1163-1175

  Ford, Jeff ^a   Gál, Anna ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATRIX ALGEBRA; TENSORS;

COMMUNICATION PROBLEMS; HADAMARD TENSORS; MULTIPARTY COMMUNICATION;

COMPUTER SCIENCE;

EID: 26444498538     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_94     Document Type: Conference Paper

References (24)

1. N. Alon, J. H. Spencer, "The Probabilistic Method", Wiley-Interscience, 2000.
2. L. Babai, N. Nisan, M. Szegedy, "Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs", JCSS, 45(2):204-232, 1992.
3. L. Babai, T. P. Hayes, P. G. Kimmel, "The Cost of the Missing Bit: Communication Complexity with Help", Proc. 30th ACM STOC, 673-682, 1998.
4. 1", JCSS, 38(1):150-164, 1989.
5. R. Beigel, J. Tarui, "On ACC", Proc. 32nd IEEE FOCS, 783-792, 1991.
6. M. R. Best, "The Excess of a Hadamard Matrix", Indag. Math., 39(5):357-361, 1977.
7. A. Chandra, M. Furst, R. Lipton: "Multiparty protocols", Proc. 15th ACMSTOC, 94-99, 1983.
8. B. Chor, O. Goldreich, "Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity", SIAM J. Comp. 17:230-261, 1988.
9. F. Chung, "Quasi-Random Classes of Hypergraphs", Random Structures and Algorithms, 1(4):363-382, 1990.
10. F. Chung, P. Tetali, "Communication complexity and quasi randomness", SIAM J. Discrete Math., 6(1):110-123, 1993.
11. P. Erdos, J. H. Spencer, "Probabilistic methods in combinatorics", Academic Press, 1974.
12. V. Grolmusz, "The BNS Lower Bound for Multi-Party Protocols is Nearly Optimal", Information and Computation, 112:51-54, 1994.
13. J. Håstad, M. Goldmann, "On the power of small depth threshold circuits", Computational Complexity, 113-129, 1991.
14. E. Kushilevitz, N. Nisan, "Communication complexity", Cambridge, 1997.
15. J. H. van Lint, R. M. Wilson, "A Course in Combinatorics", Cambridge, 1992.
16. N. Nisan, A. Wigderson, "Rounds in communication complexity revisited" SIAM J. Comp., 22:211-219, 1993.
17. P. Pudlák, "Unexpected upper bounds on the complexity of some communication games", Proc. ICALP'94, 1-11, 1994.
18. P. Pudlák, V. Rödl, J. Sgall, "Boolean circuits, tensor ranks and communication complexity", SIAM J. Comp., 26:605-633, 1997.
19. R. Raz, "The BNS-Chung criterion for multiparty communication complexity", Computational Complexity, 9(2):113-122, 2000.
20. J. Spencer, "Ten lectures on the probabilistic method", Soc. for Industrial and Applied Math., 1987.
21. V. Shoup, "New Algorithms for Finding Irreducible Polynomials over Finite Fields", Mathematics of Computation, 54:435-447, 1990.
22. J.H. van Lint, "Introduction to Coding Theory", Springer-Verlag, 1998.
23. A. Yao, "Some complexity questions related to distributed computing", Proc. 11th ACM STOC, 209-213, 1979.
24. A. Yao, "On ACC and threshold circuits", Proc. 31st IEEE FOCS, 619-627, 1990.