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
74
Voted
APPROX
2006
Springer
72
views
Algorithms
»
more
APPROX 2006
»
Local Decoding and Testing for Homomorphisms
15 years 6 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