Back to Results
First PageMeta Content
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

Document Date: 2008-09-15 00:54:52

Open Document

File Size: 178,50 KB

Share Result on Facebook

City

Stockholm / /

Country

Sweden / Sudan / /

/

Facility

Computer Science Royal Institute of Technology / /

IndustryTerm

arbitrary algorithm / list decoding algorithm / e-fraction / probabilistic algorithm / inner product / possible applications / list-decoding algorithm / cryptographic algorithms / /

Organization

Goldreich-Levin Predicate Gustav Hast Department of Numerical Analysis / Institute of Technology / /

Position

author / hb / /

ProgrammingLanguage

C / /

Technology

arbitrary algorithm / guessing algorithm / list-decoding algorithm / cryptography / Fourier-transform algorithm / list decoding algorithm / probabilistic algorithm / /

SocialTag