Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > RICHNESS METHOD:
Reports tagged with richness method:
TR17-170 | 6th November 2017
We develop a technique for proving lower bounds in the setting of asymmetric communication, a model that was introduced in the famous works of Miltersen (STOC'94) and Miltersen, Nisan, Safra and Wigderson (STOC'95). At the core of our technique is a novel simulation theorem: Alice gets a $p \times n$ ... more >>>