TY - GEN
T1 - Self-testing polynomial functions efficiently and over rational domains
AU - Rubinfeld, Ronitt
AU - Sudan, Madhu
N1 - Funding Information:
__TL%rew University. This work was done while the author was at Princeton University. Supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), NSF-STC88-09648. Part of this research was also done while the author was visiting Bellcore. tU.C. Berkeley. Research supported by NSF PYI Grant CCR 8896202.
PY - 1992/9/1
Y1 - 1992/9/1
N2 - 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].
AB - 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].
UR - http://www.scopus.com/inward/record.url?scp=85029508009&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85029508009
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 23
EP - 32
BT - Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
PB - Association for Computing Machinery
T2 - 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
Y2 - 27 January 1992 through 29 January 1992
ER -