Lower bounds on the multiparty communication complexity
From MaRDI portal
Publication:1267715
DOI10.1006/jcss.1997.1547zbMath0917.94024MaRDI QIDQ1267715
Publication date: 8 December 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1547
algorithmic information theory; Boolean functions; lower bounds; multiparty communication complexity
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Cites Work