An algebraic approach to communication complexity /
In this work, we define the communication complexity of a monoid M as the maximum complexity of any language recognized by M, and show that monoid classes defined by, communication complexity classes form varieties. Then we prove that a group G has constant communication complexity for k players if...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1998
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21653 |