Nearly One-Sided Tests and the Goldreich-Levin Predicate Gustav Hast Department of Numerical Analysis and Computer Science Royal Institute of Technology, [removed]Stockholm, Sweden [removed]

First Page		Document Content
Date: 2008-09-15 00:54:52 Pseudorandomness Probabilistic complexity theory Coding theory Error detection and correction Hard-core predicate Pseudorandom generator theorem List decoding Randomized algorithm Averaging argument Theoretical computer science Applied mathematics Computational complexity theory		Nearly One-Sided Tests and the Goldreich-Levin Predicate Gustav Hast Department of Numerical Analysis and Computer Science Royal Institute of Technology, [removed]Stockholm, Sweden [removed] Add to Reading List Source URL: www.iacr.org Download Document from Source Website File Size: 178,50 KB Share Document on Facebook