Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
72
Microsoft Research330 тыс
Следующее
Популярные
339 дней – 1 8111:44
03.11.22 – 7711:00:39Опубликовано 7 сентября 2016, 16:47
In this work we show how to deterministically extract high quality randomness from several independent sources of low quality randomness. We construct an extractor that can extract from a constant (c) number of independent sources of length n (N = 2^n), each of which have min-entropy that is polynomially small in n (say n^delta for some arbitrarily small constant delta). Our extractor is built by composing previous constructions of strong seeded extractors in simple ways. We introduce a new technique to condense somewhere random sources that seems like a useful way to manipulate independent sources.
Свежие видео
4 дня – 1 1064:52
6 дней – 6746:24
13 дней – 22113:16
17 дней – 1 9551:41
18 дней – 16 5757:44
21 день – 88 81712:09Случайные видео
13 дней – 4610:42
188 дней – 548 4090:53
290 дней – 9 2270:25
325 дней – 8 10619:08
24.05.23 – 1 6584:14
25.04.23 – 107 49625:55
5 дней – 2 3170:40
5 дней – 7 0582:15
6 дней – 1354:09
9 дней – 1 4840:59
11 дней – 9110:31
12 дней – 141 35710:21
16 дней – 61110:56
3 дня – 30 0661:00