JavaScript is disabled for your browser. Some features of this site may not work without it.
Robust Characterizations of Polynomials and Their Applications to Program Testing
dc.contributor.author | Rubinfeld, Ronitt | en_US |
dc.contributor.author | Sudan, Madhu | en_US |
dc.date.accessioned | 2007-04-23T16:32:34Z | |
dc.date.available | 2007-04-23T16:32:34Z | |
dc.date.issued | 1993-09 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1387 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6161 | |
dc.description.abstract | The 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.extent | 2794556 bytes | |
dc.format.extent | 552898 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Robust Characterizations of Polynomials and Their Applications to Program Testing | en_US |
dc.type | technical report | en_US |