13 search results - page 1 / 3 » Self-Testing Polynomial Functions Efficiently and Over Ratio... |
SODA
1992
ACM
13 years 6 months ago
1992
ACM
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 simp...
STOC
1991
ACM
13 years 8 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
STACS
2000
Springer
13 years 8 months ago
2000
Springer
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...
ASAP
2008
IEEE
13 years 6 months ago
2008
IEEE
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...