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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
22
click to vote
APPROX
2006
Springer
favorite
Email
discuss
report
72
views
Algorithms
»
more
APPROX 2006
»
Local Decoding and Testing for Homomorphisms
14 years 2 months ago
Download
web.mit.edu
Elena Grigorescu, Swastik Kopparty, Madhu Sudan
Real-time Traffic
Algorithms
|
APPROX 2006
|
claim paper
Related Content
»
Derandomizing homomorphism testing in general groups
»
PublicKey LocallyDecodable Codes
»
Comparing Universal Covers in Polynomial Time
»
A DecoderBased Evolutionary Algorithm for Constrained Parameter Optimization Problems
»
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuit...
»
Local ListDecoding and Testing of Random Linear Codes from HighError
»
Tolerant Linearity Testing and Locally Testable Codes
»
Some Recent Results on Local Testing of Sparse Linear Codes
»
Generalizing Local and NonLocal WordReordering Patterns for SyntaxBased Machine Translatio...
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2006
Where
APPROX
Authors
Elena Grigorescu, Swastik Kopparty, Madhu Sudan
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision