Latest posts tagged with #CommunicationComplexity on Bluesky
USC researchers prove quantum communication solves the lifted Hidden Matching problem in O(log n), while any k-party randomised protocol requires Ω(n^1/3 / 2^k/3) — the first exponential separation in the one-way Numbers-on-Forehead model.
#QuantumCommunication #CommunicationComplexity #News
Subquadratic Two‑Party Protocol Reduces Communication for Minimum Cost Flow
A new two‑party protocol solves minimum cost flow with communication cost ~O(n¹·⁵) bits, down from ~O(n²); it also handles linear programs in ~O(n¹·⁵ k) bits. getnews.me/subquadratic-two-party-p... #minimumcostflow #communicationcomplexity
New Hierarchy Classifies Constant Communication Complexity Measures
A new preprint classifies communication‑complexity measures into five constant‑equivalence classes, and the 45‑page manuscript is available via its arXiv DOI. Read more: getnews.me/new-hierarchy-classifies... #communicationcomplexity #research
