An Application of Hindman's Theorem to a Problem on Communication Complexity
From MaRDI portal
Publication:4655908
DOI10.1017/S0963548303005790zbMath1088.68612OpenAlexW2159517059MaRDI QIDQ4655908
Publication date: 8 March 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548303005790
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Ramsey theory (05D10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
The NOF multiparty communication complexity of composed functions ⋮ MONOIDS AND COMPUTATIONS ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem
This page was built for publication: An Application of Hindman's Theorem to a Problem on Communication Complexity
