Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

SODA
1992
ACM

favoriteEmaildiscussreport

90views Algorithms» more SODA 1992»

Self-Testing Polynomial Functions Efficiently and Over Rational Domains

13 years 5 months ago

Self-Testing Polynomial Functions Efficiently and Over Rational Domains

Download people.csail.mit.edu

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].

Ronitt Rubinfeld, Madhu Sudan

Real-time Traffic

Algorithms | Integer Domains | Self-testing Polynomials | SODA 1992 | Stronger Bounds |

claim paper

Related Content

» SelfTestingCorrecting for Polynomials and for Approximate Functions

» Multilinearity SelfTesting with Relative Error

» An efficient method for evaluating polynomial and rational function approximations

» A correct precise and efficient integration of setsharing freeness and linearity for the a...

» On the Hardness of the Noncommutative Determinant

» FiniteTree Analysis for Constraint LogicBased Languages The Complete Unabridged Version

» Interactive Cost Configuration Over Decision Diagrams

» Hierarchically Nested Convex VCSP

» Efficient Factorisation Algorithm for List Decoding AlgebraicGeometric and ReedSolomon Cod...

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	1992
Where	SODA
Authors	Ronitt Rubinfeld, Madhu Sudan

Comments (0)