Tight bounds for communication-assisted agreement distillation

DOI10.4230/LIPIcs.CCC.2016.6zbMath1380.94067OpenAlexW2465286492MaRDI QIDQ5368740

Venkatesan Guruswami

Publication date: 10 October 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CCC.2016.6

zbMATH Keywords

covering codeslower boundsinformation theorycommunication complexitypseudorandomnesshypercontractivity

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information theory (general) (94A15)

Related Items (1)

One-message secure reductions: on the cost of converting correlations

This page was built for publication: Tight bounds for communication-assisted agreement distillation