An Algebraic Approach to Communication Complexity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Communication Complexity
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Multi-resolution Texture Classification Based on Local Image Orientation
ICIAR '08 Proceedings of the 5th international conference on Image Analysis and Recognition
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Hi-index | 0.01 |
We consider the $k$-party communication complexity of the problem of determining if a word $w$ is of the form $w_0a_1w_1a_2\dots w_{k-1}a_kw_k$, for fixed letters $a_1,\dots,a_k$. Using the well-known theorem of Hindman (a Ramsey-type result about finite subsets of natural numbers), we prove that for $k=4$ and $5$ the communication complexity of the problem increases with the length of the word $w$.