534 search results - page 2 / 107 » Efficient polynomial L-approximations |
83
Voted
ARITH
2007
IEEE
15 years 3 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
80
Voted
SODA
1992
ACM
15 years 24 days 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...
100
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
86
Voted
ICMS
2010
14 years 9 months ago
2010
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...