Currently displaying 1 – 7 of 7

Showing per page

Order by Relevance | Title | Year of publication

Communication Complexity and Lower Bounds on Multilective Computations

Juraj Hromkovič — 2010

RAIRO - Theoretical Informatics and Applications

Communication complexity of two-party (multiparty) protocols has established itself as a successful method for proving lower bounds on the complexity of concrete problems for numerous computing models. While the relations between communication complexity and oblivious, semilective computations are usually transparent and the main difficulty is reduced to proving nontrivial lower bounds on the communication complexity of given computing problems, the situation essentially changes, if one...

Page 1

Download Results (CSV)