Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

97

Voted

APPROX
2009
Springer

107views Algorithms» more APPROX 2009»

Extractors Using Hardness Amplification

15 years 6 months ago

Extractors Using Hardness Amplification

Download www.cs.berkeley.edu

Anindya De, Luca Trevisan

Real-time Traffic

Algorithms | APPROX 2009 |

claim paper

Related Content

» Using nondeterminism to amplify hardness

» Query Complexity in Errorless Hardness Amplification

» Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas

» Portably Solving File TOCTTOU Races with Hardness Amplification

» Uniform Hardness Amplification in NP via Monotone Codes

» Hardness Amplification via SpaceEfficient Direct Products

» Proofs of Retrievability via Hardness Amplification

» Simple Extractors via Constructions of Cryptographic Pseudorandom Generators

» Better extractors for better codes

Post Info
More Details (n/a)

Added	12 Aug 2010
Updated	12 Aug 2010
Type	Conference
Year	2009
Where	APPROX
Authors	Anindya De, Luca Trevisan

Comments (0)