Languages with Bounded Multiparty Communication Complexity
From MaRDI portal
Publication:3590958
DOI10.1007/978-3-540-70918-3_43zbMath1186.68249MaRDI QIDQ3590958
Mario Szegedy, Michal Koucký, Andreas Krebs, Pascal Tesson, Denis Thérien, Arkadev Chattopadhyay
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_43
Related Items
The NOF multiparty communication complexity of composed functions, A note on multiparty communication complexity and the Hales-Jewett theorem, Quivers of monoids with basic algebras, An Algebraic Perspective on Boolean Function Learning