12 search results - page 2 / 3 » issac 1997 |
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...