Average Bias and Polynomial Sources

We identify a new notion of pseudorandomness for randomness sources, which we call the average bias. Given a distribution $Z$ over $\{0,1\}^n$, its average bias is: $b_{\text{av}}(Z) =2^{-n} \sum_{c \in \{0,1\}^n} |\mathbb{E}_{z \sim Z}(-1)^{\langle c, z\rangle}|$. A source with average bias at most...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bhattacharyya, Arnab, John, Philips George, Ghoshal, Suprovat, Meka, Raghu
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!