Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity - Computer Science > Computational ComplexityReportar como inadecuado




Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity - Computer Science > Computational Complexity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Let f subset of X x Y x Z be a relation. Let the public coin one-waycommunication complexity of f, with worst case error 1-3, be denotedR^{1,pub} {1-3}f. We show that if for computing f^k k independent copies off, ok R^{1,pub} {1-3}f communication is provided, then the success isexponentially small in k. This settles the strong direct product conjecture forall relations in public coin one-way communication complexity.We show a new tight characterization of public coin one-way communicationcomplexity which strengthens on the tight characterization shown in J.,Klauck, Nayak 08. We use the new characterization to show our direct productresult and this may also be of independent interest.



Autor: Rahul Jain

Fuente: https://arxiv.org/







Documentos relacionados