ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We present a streamlined and refined version of Karr’s summation algorithm. Karr’s original approach constructively decides the telescoping problem in ΠΣ-fields, a very ge...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
Let n/d ∈ Q, m be a positive integer and let u = n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d.
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...