On different modes of communication
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Communication complexity
Handbook of formal languages, vol. 1
Automata, Languages, and Machines
Automata, Languages, and Machines
Polynomial Closure and Unambiguous Product
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
An Algebraic Approach to Communication Complexity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
SIAM Journal on Computing
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Separating the communication complexities of MOD m and MOD p circuits
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we study the non-deterministic communication complexity of regular languages. We show that a regular language has either constant or at least logarithmic non-deterministic communication complexity. We prove several linear lower bounds which we know cover a wide range of regular languages with linear complexity. Furthermore we find evidence that previous techniques (Tesson and Thérien 2005) for proving linear lower bounds, for instance in deterministic and probabilistic models, do not work in the non-deterministic setting.