1379 search results - page 20 / 276 » The Complexity of the Annihilating Polynomial |
FCT
2001
Springer
15 years 2 months ago
2001
Springer
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
TCS
2008
14 years 9 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
ISSAC
2007
Springer
15 years 4 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...
COCOON
2005
Springer
15 years 3 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...