2430 search results - page 16 / 486 » Computing Tutte Polynomials |
ANTS
2008
Springer
13 years 9 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
JSC
2002
13 years 7 months ago
2002
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
ISSAC
1998
Springer
13 years 12 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
AISC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
SIAMSC
2011
13 years 2 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...