42 search results - page 1 / 9 » A Binary Recursive Gcd Algorithm |
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
ANTS
1994
Springer
13 years 9 months ago
1994
Springer
ISSAC
2007
Springer
13 years 11 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...
ICCAD
1994
IEEE
13 years 9 months ago
1994
IEEE
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...