=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 than a symmetric language has bounded k-party communication complexity for some fixed k iff it has bounded 2-party communication complexity."> =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 than a symmetric language has bounded k-party communication complexity for some fixed k iff it has bounded 2-party communication complexity."> Languages with Bounded Multiparty Communication Complexity
Počet záznamů: 1  

Languages with Bounded Multiparty Communication Complexity

    1.
    Chattopadhyay, A. - Koucký, Michal - Krebs, A. - Szegedy, M. - Tesson, P. - Thérien, D.
    Languages with Bounded Multiparty Communication Complexity.
    Proceeding of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2007. Berlin: Springer-Verlag, 2007 - (Thomas, W.; Weil, P.), s. 500-511. Lecture Notes in Computer Science, 4393. ISBN 978-3-540-70917-6.
    [Annual Symposium on Theoretical Aspects of Computer Science (STACS). Aachen (DE), 22.02.2007-24.02.2007]
    http://hdl.handle.net/11104/0147333
Počet záznamů: 1  

  Tyto stránky využívají soubory cookies, které usnadňují jejich prohlížení. Další informace o tom jak používáme cookies.

Přijmout všeNastaveníOdmítnout vše