Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
The BNS lower bound for multi-party protocols is nearly optimal
Information and Computation
Superlinear lower bounds for bounded-width branching programs
Journal of Computer and System Sciences
Communication complexity
Handbook of formal languages, vol. 1
Monotone Circuits for Connectivity Have Depth (log n)2-o(1)
SIAM Journal on Computing
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Algebraic Approach to Communication Complexity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Upper Bounds on Multiparty Communication Complexity of Shifts
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An Application of Hindman's Theorem to a Problem on Communication Complexity
Combinatorics, Probability and Computing
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences
Separating the communication complexities of MOD m and MOD p circuits
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Restricted two-variable FO + MOD sentences, circuits and communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We study languages with bounded communication complexity in the multiparty "input on the forehead model" with worst-case partition. In the two-party case, languages with bounded complexity are exactly those recognized by programs over commutative monoids [19]. This can be used to show that these languages all lie in shallow ACC0. In contrast, we use coding techniques to show that there are languages of arbitrarily large circuit complexity which can be recognized in constant communication by k players for k ≥ 3. However, we show that if a language has a neutral letter and bounded communication complexity in the k-party game for some fixed k then the language is in fact regular. We give an algebraic characterization of regular languages with this property. We also prove that a symmetric language has bounded k-party complexity for some fixed k iff it has bounded two party complexity.