230 search results - page 2 / 46 » Faster algorithms for the characteristic polynomial |
ESA
2008
Springer
13 years 8 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
ISSAC
2009
Springer
14 years 21 days ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
TCS
2011
13 years 1 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
ISSAC
2009
Springer
14 years 21 days ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...