Distribution Testing Lower Bounds via Reductions from Communication Complexity

ACM TRANSACTIONS ON COMPUTATION THEORY, 2019.

Cited by: 0|Bibtex|Views4|Links
Keywords:
Communication complexitydistribution testinglower boundsproperty testingK-functional

Abstract:

We present a new methodology for proving distribution testing lower bounds, establishing a connection between distribution testing and the simultaneous message passing (SMP) communication model. Extending the framework of Blais, Brody, and Matulef [15], we showa simpleway to reduce (private- coin) SMP problems to distribution testing prob...More

Code:

Data:

Your rating :
0

 

Tags
Comments