The cost of the missing bit: Communication complexity with help

Combinatorica

Volumn 21, Issue 4, 2001, Pages 455-488

  Babai, László ^a   Hayes, Thomas P ^b   Kimmel, Peter G ^c  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

^c NORTHEASTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039304089     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930100009     Document Type: Article

References (29)

1. L. BABAI: The Fourier Transform and Equations Over Finite Abelian Groups, Lecture Notes, manuscript, version 1.2, December 1989.
2. L. BABAI, T. HAYES: Finding a generator for a subfield of a finite field, manuscript, 2000.
3. L. BABAI, T. HAYES, and P. KIMMEL: The Cost of the Missing Bit: Communication Complexity with Help, (Preliminary version) 30th ACM STOC (1998), 673-682.
4. L. BABAI, P. KIMMEL, and S. V. LOKAM: Simultaneous Messages vs. Communication, 12th Symp. Theor. Asp. Comp. Sci., 1995, Springer Lecture Notes in Comp. Sci. 900 (1995), 361-372. Updated version: L. BABAI, A. GÁL, P. KIMMEL, and S. V. LOKAM: Simultaneous Messages vs. Communication, SIAM J. Comput., to appear.
5. L. BABAI, P. KIMMEL, and S. V. LOKAM: Simultaneous Messages vs. Communication, 12th Symp. Theor. Asp. Comp. Sci., 1995, Springer Lecture Notes in Comp. Sci. 900 (1995), 361-372. Updated version: L. BABAI, A. GÁL, P. KIMMEL, and S. V. LOKAM: Simultaneous Messages vs. Communication, SIAM J. Comput., to appear.
6. L. BABAI, N. NISAN, and M. SZEGEDY: Multiparty Protocols, Pseudorandom Generators for Logspace and Time-Space Trade-offs, J. Comput. System Sci., 45 (1992), 204-232. (Preliminary version: 20th ACM STOC (1988), 539-550.)
7. L. BABAI, N. NISAN, and M. SZEGEDY: Multiparty Protocols, Pseudorandom Generators for Logspace and Time-Space Trade-offs, J. Comput. System Sci., 45 (1992), 204-232. (Preliminary version: 20th ACM STOC (1988), 539-550.)
8. R. BEIGEL and J. TARUI: On ACC. 32nd IEEE FOCS (1991), 783-792.
9. E. R. BERLEKAMP: Factoring polynomials over large finite fields, Math. Comput., 24 (1970), 713-735.
10. A. K. CHANDRA, M. L. FURST, and R. J. LIPTON: Multiparty Protocols, 15th ACM STOC (1983), 94-99.
11. F. R. K. CHUNG and P. TETALI: Communication complexity and quasi randomness, SIAM J. Discrete Math., 6 (1993), 110-123.
12. L. CARTER and M. WEGMAN: Universal Hash Functions, J. Comput. System Sci., 18 (1979), 143-154.
13. H. D. GRÖGER, G. TURAáN: On linear decision trees computing boolean functions. 18th ICALP, Springer Lect. Notes in Comp. Sci., 510 (1991), 707-719.
14. V. GROLMUSZ: Separating the Communication Complexities of MOD m and MOD p Circuits, J. Comput. System Sci., 51 (1995), 307-313. (Preliminary version: 33rd IEEE FOCS (1992), 278-287.)
15. V. GROLMUSZ: Separating the Communication Complexities of MOD m and MOD p Circuits, J. Comput. System Sci., 51 (1995), 307-313. (Preliminary version: 33rd IEEE FOCS (1992), 278-287.)
16. A. HAJNAL, W. MAASS, P. PUDLÁK, M. SZEGEDY, G. TURÁN: Threshold circuits of bounded depth, 28th IEEE FOCS (1987), 99-110.
17. J. HÅSTAD and M. GOLDMANN: On the power of small-depth threshold circuits, Computational Complexity, 1 (1991), 113-129.
18. K. IRELAND and M. ROSEN: A Classical Introduction to Modern Number Theory, Springer-Verlag, 1982.
19. E. KUSHILEVITZ and N. NISAN: Communication Complexity, Cambridge University Press, 1997.
20. M. LUBY, B. VELIČKOVIĆ, and A. WIGDERSON: Deterministic Approximate Counting of Depth-2 Circuits, Proc. Second Israel Symp. on Theory and Computing Systems, IEEE Comp. Soc. Press, 1993, 18-24.
21. Y. MANSOUR, N. NISAN, and P. TIWARI: The Computational Complexity of Universal Hashing, Theor. Comp. Sci., 107 (1993), 121-133.
22. N. NISAN : The communication complexity of threshold gates, in: Combinatorics, Paul Erdos is Eighty (D. Miklós, T. Szonyi, V.T. Sós, eds.), Vol. 1. Bolyai Society Mathematical Studies 1, Budapest 1993, J. Bolyai Math. Society, http://www.bolyai.hu/studies.html, 301-315.
23. N. NISAN, A. WIGDERSON: Rounds in Communication Complexity Revisited, SIAM J. Comput., 22 (1993), 211-219. (Preliminary version: 23rd ACM STOC (1991), 419-429.)
24. N. NISAN, A. WIGDERSON: Rounds in Communication Complexity Revisited, SIAM J. Comput., 22 (1993), 211-219. (Preliminary version: 23rd ACM STOC (1991), 419-429.)
25. P. PUDLÁK, V. RÖDL, and J. SGALL: Boolean Circuits, Tensor Ranks and Communication Complexity, SIAM J. Comput., 26 (1997), 605-633.
26. M. RABIN: Probabilistic Algorithms in Finite Fields, SIAM J. Comput., 9 (1980), 273-280.
27. W. M. SCHMIDT: Equations over Finite Fields: An Elementary Approach, Lect. Notes in Math., 536, Springer 1976.
28. A. WIGDERSON: Personal communication, April 20, 1997.
29. A. C-C. YAO: On ACC and Threshold Circuits, 31st IEEE FOCS (1990), 619-627.