ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We study the triangular representation of zero-dimensional varieties defined over the rational field (resp. a rational function field). We prove polynomial bounds in terms of i...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
There exist sound literature and algorithms for computing Liouvillian solutions for the important problem of linear ODEs with rational coefficients. Taking as sample the 363 secon...