Query-to-Communication Lifting for BPP

SIAM J. Comput., 2020.

Cited by: 0|Bibtex|Views4|DOI:https://doi.org/10.1137/17M115339X
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de

Abstract:

For any $n$-bit boolean function $f$, we show that the randomized communication complexity of the composed function $f\\circ g^n$, where $g$ is an index gadget, is characterized by the randomized de...

Code:

Data:

Your rating :
0

 

Tags
Comments