A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Query-to-Communication Lifting for BPP
[article]
2017
arXiv
pre-print
For any n-bit boolean function f, we show that the randomized communication complexity of the composed function f∘ g^n, where g is an index gadget, is characterized by the randomized decision tree complexity of f. In particular, this means that many query complexity separations involving randomized models (e.g., classical vs. quantum) automatically imply analogous separations in communication complexity.
arXiv:1703.07666v1
fatcat:am5teisncfbq3bl5hoaqpqxube