Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- Vol. 18, 399-410
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers2011
- Extractors and Lower Bounds for Locally Samplable SourcesLecture Notes in Computer Science, 2011
- Simple Affine Extractors Using Dimension Expansion2010
- Extractors for Varieties2009
- Affine dispersers from subspace polynomials2009
- Extractors And Rank Extractors For Polynomial Sourcescomputational complexity, 2009
- Deterministic extractors for affine sources over large fieldsCombinatorica, 2008
- On the Construction of Affine ExtractorsGeometric and Functional Analysis, 2007
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- A Boolean function requiring 3n network sizeTheoretical Computer Science, 1983