Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
From affine to two-source extractors via approximate duality
Proceedings of the forty-third annual ACM symposium on Theory of computing
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
Proceedings of the forty-third annual ACM symposium on Theory of computing
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Extractors and lower bounds for locally samplable sources
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
On identity testing of tensors, low-rank recovery and compressed sensing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
An (n,k)-affine source over a finite field $$\mathbb{F}$$is a random variable X = (X1,..., Xn) ∈ $$\mathbb{F}^n$$, which is uniformly distributed over an (unknown) k-dimensional affine subspace of $$\mathbb{F}^n$$. We show how to (deterministically) extract practically all the randomness from affine sources, for any field of size larger than nc (where c is a large enough constant). Our main results are as follows: (For arbitraryk): For any n,k and any $$\mathbb{F}$$of size larger than n20, we give an explicit construction for a function D : $$\mathbb{F}^n $$→ $$\mathbb{F}^{k - 1}$$, such that for any (n,k)-affine source X over $$\mathbb{F}$$, the distribution of D(X) is ∊-close to uniform, where ∊ is polynomially small in |$$\mathbb{F}$$|. (Fork=1): For any n and any $$\mathbb{F}$$ of size larger than nc, we give an explicit construction for a function D: $$\mathbb{F}^n \to \{ 0,1\} ^{(1 - \delta )log_2 |\mathbb{F}|}$$, such that for any (n, 1)-affine source X over $$\mathbb{F}$$, the distribution of D(X) is ∊-close to uniform, where ∊ is polynomially small in |$$\mathbb{F}$$|. Here, δ0 is an arbitrary small constant, and c is a constant depending on δ.