Počet záznamů: 1
Languages with Bounded Multiparty Communication Complexity
- 1.
SYSNO ASEP 0041539 Druh ASEP V - Výzkumná zpráva Zařazení RIV V – výzkumná zpráva Název Languages with Bounded Multiparty Communication Complexity Překlad názvu Report TR06-117 Tvůrce(i) Chattopadhyay, A. (CA)
Koucký, Michal (MU-W) RID, SAI, ORCID
Kreb, A. (DE)
Szegedy, M. (US)
Tesson, P. (CA)Vyd. údaje Trier: Electronic Colloquium on Computational Complexity, 2006 ISSN 1433-8092 Poč.str. 17 s. Jazyk dok. eng - angličtina Země vyd. DE - Německo Klíč. slova communication complexity ; codes ; Ramsey theory Vědní obor RIV BA - Obecná matematika CEZ AV0Z10190503 - MU-W (2005-2011) Anotace We study languages with bounded communication complexity in the multiparty "input on the forehead" model with worst-case partition. In the two party case, it is known that such languages are exactly those that are recognized by programs over commutative monoids. This can be used to show that these languages can be computed by shallow ACC0 circuits. In contrast, we use coding techniques to show that there languages of arbitrarily circuit complexity that can be computed by players using constant communication, if k > = 3. However, if the language has a neutral letter and constant communication complexity for k players 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 communication complexity for some fixed k if it has bounded 2-party communication complexity. Pracoviště Matematický ústav Kontakt Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Rok sběru 2007
Počet záznamů: 1