Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
102
click to vote
FOCS
2006
IEEE
119
views
Theoretical Computer Science
»
more
FOCS 2006
»
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
15 years 9 months ago
Download
www.cs.columbia.edu
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab
Real-time Traffic
FOCS 2006
|
Theoretical Computer Science
|
claim paper
Related Content
»
ListDecoding Using The XOR Lemma
»
Uniform Hardness Amplification in NP via Monotone Codes
»
Uniform Direct Product Theorems Simplified Optimized and Derandomized
more »
Post Info
More Details (n/a)
Added
11 Jun 2010
Updated
11 Jun 2010
Type
Conference
Year
2006
Where
FOCS
Authors
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision