Abstract: We prove that corruption, one of the most powerful measures used to analyze 2-party randomized communication complexity, satisfies a strong direct sum ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results