On the separation between k-party and (k – 1)-party nondeterministic message complexities

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

Volumn 2450, Issue , 2003, Pages 152-161

  Adorna, Henry N ^a,b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b Institute of Mathematics and Natural Sciences Research Institute   (Philippines)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION COMPLEXITY; LOWER BOUND METHOD; MESSAGE COMPLEXITY; TWO-PARTY PROTOCOLS;

ARTIFICIAL INTELLIGENCE;

EID: 84949921365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45005-x_13     Document Type: Conference Paper

References (16)

1. H. Abelson, Lower Bounds on Information Transfer in Distributed Computation. Proc. 19th IEEE FOCS (1978), 151-158.
2. H.N. Adorna, Some Properties of k-Party Message Complexity. Unpublished Manuscript, RWTH-Aachen (2001).
3. H.N. Adorna, 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automaton. In: J. Dassow, D. Wotschke (eds.) Pre-Proc. 3rd Internatonal Workshop on Descriptional Complexity of Automata, Grammars and Related Structures Preprint No. 16, Uni. Magdeburg. (2001), 23-34.
4. J.E. Hopcroft, J.D. Ullman, Introduction Automata Theory, Languages and Computation. Addison-Wesley, 1979.
5. J. Hromkovič, Relation Between Chomsky Hierarchy and Communication Complexity Hierarchy Acta Math. Univ. Com., Vol 48-49 (1986), 311-317.
6. J. Hromkovič, Communication Complexity and Parallel Computating. Springer, 1997.
7. J. Hromkovič, G. Schnitger, Communication Complexity and Sequential Computation. In: Pr´iara, P. Ruˇzička (eds.) Proc. of Mathematical Foundation of Computer Science, LNCS 1295, Springer-Verlag (1997) 71-84.
8. J. Hromkovič, G. Schnitger, On the Power of Las Vegas for One-Way Communication Complexity, OBDD’s and Finite Automata. Information and Computation, 169 (2001), 284-296.
9. J. Hromkovič, S. Seibert, J Karhumäki, H. Klauck, G. Schnitger, Communication Complexity Method for Measuring Nondeterminism in Finite Autmata. Information and Computation 172 (2002), 202-217.
10. G. Jirăskova, Finite Automata and Communication Protocols. In: C. Martin- Vide, V. Mitrana (eds.) Words, Sequences, Grammars, Languages: Where Biology, Computer Science, Linguistics and Mathematics Meet II, to appear.
11. H. Klauck, G. Schnitger, Nondeterministic Finite Automata versus Nondeterministic Uniform Communication Complexity. Unpublished Manuscript, University of Frankfurt, (1996).
12. E. Kushilevitz, N. Nisan, Communication Complexity. Cambridge University Press, 1997.
13. F. Moore, On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic and Two-Way Finite Automata. IEEE Trans. Comput. 20 (1971), 1211-1214.
14. C. Papadimitriou, M. Sipser, Communication Complexity. Proc. 14th ACM STOC, (1982), 196-200.
15. P. Tiwari, Lower Bound on Communication Complexity in Distributed Computer Networks. Journal of the ACM, Vol.42, No. 4 (1987) 921-938.
16. A.C. Yao, Some Complexity Questions Related to Distributed Computing. Proc. 11th ACM STOC, (1979), 209-213.