The Hardness of Median in the Synchronized Bit Communication Model
From MaRDI portal
Publication:3010421
DOI10.1007/978-3-642-20877-5_40zbMath1331.68080arXiv1102.1208MaRDI QIDQ3010421
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.1208
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work