Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Preeti Malakar, Thomas George, et al.
SC 2012
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000