16 search results - page 1 / 4 » Practical Divide-and-Conquer Algorithms for Polynomial Arith... |
CASC
2011
Springer
12 years 4 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
CORR
2008
Springer
13 years 4 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...
AISC
2008
Springer
13 years 6 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose a new number representation and arithmetic for the elements of the ring of integers modulo p. The socalled Polynomial Modular Number System (PMNS) allows for fast polyn...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...