B. Wagle
EJOR
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.
B. Wagle
EJOR
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Preeti Malakar, Thomas George, et al.
SC 2012
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007