Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions

Electronic Colloquium on Computational Complexity (ECCC), pp. 292019.

Cited by: 0|Bibtex|Views37|Links
EI

Abstract:

seminal result of Kahn, Kalai and Linial shows that a coalition of $O(frac{n}{log n})$ players can bias the outcome of any Boolean function ${0,1}^n {0,1}$ with respect to the uniform measure. extend their result to arbitrary product measures on ${0,1}^n$, by combining their argument with a completely different argument that handles ve...More

Code:

Data:

Your rating :
0

 

Tags
Comments