42 search results - page 2 / 9 » Fast evaluation of polynomials and inverses of polynomials |
CANS
2011
Springer
12 years 6 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
PG
2007
IEEE
14 years 8 days ago
2007
IEEE
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...
STOC
1998
ACM
13 years 10 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
ARITH
2007
IEEE
13 years 10 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...
WSCG
2003
13 years 7 months ago
2003
Spirals are surprisingly common in science, nature, physics, astronomy, flora and fauna, and the arts. In Cartesian coordinates they are typically transcendental functions, which ...