1383 search results - page 23 / 277 » On the Complexity of the Interlace Polynomial |
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
101
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
Interval polynomials are useful to describe perturbed polynomials. We present a graphical tool to describe how perturbations of the polynomial coefficients affect its zeros witho...
MOC
1998
14 years 11 months ago
1998
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...