Distribution Testing Lower Bounds via Reductions from Communication Complexity.

Eric Blais Clément L. Canonne Tom Gur

Published in: ACM Trans. Comput. Theory (2019)

Keyphrases

lower bound
worst case
upper bound
branch and bound algorithm
objective function
optimal solution
computational complexity
computational cost
probability distribution
power law
communication overhead
complexity measures
average case complexity
branch and bound
communication systems