ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Linear systems with structures such as Toeplitz-, Vandermonde- or Cauchy-likeness can be solved in O˜(α2 n) operations, where n is the matrix size, α is its displacement rank, ...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Symbolic computation with functions of a real variable suffers from combinatorial explosion of memory and computation time. The alternative chebfun system for such computations is...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer