230 search results - page 10 / 46 » Faster algorithms for the characteristic polynomial |
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
CASC
2010
Springer
14 years 8 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...