Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TWO SOURCE EXTRACTOR:
Reports tagged with two source extractor:
TR18-194 | 15th November 2018
Amir Yehudayoff

#### Anti-concentration in most directions

Revisions: 5

We prove anti-concentration for the inner product of two independent random vectors in the discrete cube. Our results imply Chakrabarti and Regev's lower bound on the randomized communication complexity of the gap-hamming problem. They are also meaningful in the context of randomness extraction. The proof provides a framework for establishing ... more >>>

TR20-161 | 5th November 2020
Gil Cohen, Dean Doron, Shahar Samocha

#### Seed Protecting Extractors

We introduce a new type of seeded extractors we dub seed protecting extractors. Informally, a seeded extractor is seed protecting against a class of functions $C$, mappings seeds to seeds, if the seed $Y$ remains close to uniform even after observing the output $\mathrm{Ext}(X,A(Y))$ for every choice of \$A \in ... more >>>

ISSN 1433-8092 | Imprint