Show simple item record

dc.contributor.authorRubinfeld, Ronitten_US
dc.contributor.authorSudan, Madhuen_US
dc.date.accessioned2007-04-23T16:32:34Z
dc.date.available2007-04-23T16:32:34Z
dc.date.issued1993-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1387en_US
dc.identifier.urihttps://hdl.handle.net/1813/6161
dc.description.abstractThe study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here we make this notion precise and show such a characterization for polynomials. From this characterization, we get the following three applications: First, we can construct simple and efficient self-testers for polynomial functions. Secondly, it provides results in the area of coding theory, by giving extremely fast and efficient error-detecting schemes for some well known codes. Thirdly, this error-detection scheme plays a crucial role in recent results on hardness of approximating some NP-optimization problems.en_US
dc.format.extent2794556 bytes
dc.format.extent552898 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleRobust Characterizations of Polynomials and Their Applications to Program Testingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics