Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > VISHVAJEET N:
All reports by Author Vishvajeet N:

TR23-092 | 28th June 2023
Swastik Kopparty, Vishvajeet N

Extracting Mergers and Projections of Partitions

We study the problem of extracting randomness from somewhere random sources, and related combinatorial phenomena: partition analogues of Shearer's lemma on projections.

A somewhere-random source is a tuple (X_1, \ldots, X_t) of (possibly correlated) \{0,1\}^n-valued random variables X_i where for some unknown i \in [t], X_i is guaranteed to be ... more >>>




ISSN 1433-8092 | Imprint