Title: Robust Characterizations of Polynomials with Applications to Program Testing
Abstract:The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here the authors make this notion precise and show such a characterization for pol...The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here the authors make this notion precise and show such a characterization for polynomials. From this characterization, the authors get the following applications. Simple and efficient self-testers for polynomial functions are constructed. The characterizations provide results in the area of coding theory by giving extremely fast and efficient error-detecting schemes for some well-known codes. This error-detection scheme plays a crucial role in subsequent results on the hardness of approximating some NP-optimization problems.Read More
Publication Year: 1996
Publication Date: 1996-04-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 856
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot