
The chained index problem requires Ω(n) bits of communication to solve optimally, irrespective of the number of chained instances.


coremsg

optimal-communication-complexity-of-chained-index-problem


Optimal Communication Complexity of Chained Index Problem


title_rewrite


There is no randomized constant-cost communication problem that is complete for the class of problems with constant-cost randomized protocols (BPP0). Additionally, the k-Hamming Distance problems form an infinite hierarchy within BPP0.


constant-cost-randomized-communication-protocols-do-not-have-a-complete-problem


Constant-Cost Randomized Communication Protocols Do Not Have a Complete Problem
