Self-Testing Polynomial Functions Efficiently and Over Rational Domains

In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simple modification of the algorithm for self-testing polynomials over finite fields given in [8].

• Type: Conference
• Year: 1992
• Where: SODA
• Authors: Ronitt Rubinfeld, Madhu Sudan
• Keywords: Algorithms, Integer Domains, Self-testing Polynomials, SODA 1992, Stronger Bounds