1379 search results - page 21 / 276 » The Complexity of the Annihilating Polynomial |
SAC
2006
ACM
15 years 3 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 9 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 ...
FOCM
2010
14 years 7 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
IJAC
2006
14 years 10 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...