An algebraic approach to communication complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 29-40

  Raymond, Jean François ^a   Tesson, Pascal ^a   Thérien, Denis ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY;

ALGEBRAIC APPROACHES; ALGEBRAIC CONDITIONS; COMMUNICATION COMPLEXITY; COMMUNICATION GAMES; FINITE MONOID; NILPOTENT;

C (PROGRAMMING LANGUAGE);

EID: 84878618206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055038     Document Type: Conference Paper

References (20)

1. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. Syst. Sci., 45(2):204-232, Oct. 1992.
2. 1. J. Comput. Syst. Sci., 38(1):150-164, Feb. 1989.
3. D. A. M. Barrington, H. Straubing, and D. Thérien. Non-uniform automata over groups. Information and Computation, 89(2):109-132, Dec. 1990.
4. 1. Journal of the ACM, 35(4):941-952, Oct. 1988.
5. th ACM STOC, pages 94-99, 1983.
6. S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976.
7. V. Grolmusz. Separating the communication complexities of MOD m and MOD p circuits. In Proc. 33rd IEEE FOCS, pages 278-287, 1992.
8. th ACM STOC, pages 68-74, 1994.
9. J. Håstad and M. Goldmann. On the power of small-depth threshold circuits. In Proc. 31st IEEE FOCS, volume II, pages 610-618, 1990.
10. th ACM STOC, pages 539-550, 1988.
11. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
12. L. Lovász. Communication complexity: a survey. Technical Report CS-TR-204-89, Princeton University, 1989.
13. 1: The automata theoretic viewpoint. Computational Complexity, 1:330-359, 1991.
14. J.-E. Pin. Varieties of formal languages. North Oxford Academic Publishers Ltd, London, 1986.
15. J.-E. Pin, H. Straubing, and D. Thérien. Locally trivial categories and unambiguous concatenation. J. Pure Applied Algebra, 52:297-311, 1988.
16. thth IEEE FOCS, 1997.
17. M. Szegedy. Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC. J. Comput. Syst. Sci., 47(3):405-423, 1993.
18. D. Thérien. Subword counting and nilpotent groups. In L. Cummings, editor, Combinatorics on Words: Progress and Perspectives, pages 195-208. Academic Press, 1983.
19. D. Thérien. Programs over aperiodic monoids. Theoretical Computer Science, 64(3):271-280, 29 May 1989.
20. th ACM STOC, pages 209-213, 1979.