1379 search results - page 36 / 276 » The Complexity of the Annihilating Polynomial |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
JAT
2010
14 years 8 months ago
2010
The classical Heun equation has the form Q(z) d2 dz2 + P (z) d dz + V (z) ff S(z) = 0, where Q(z) is a cubic complex polynomial, P (z) is a polynomial of degree at most 2 and ...
ISSAC
1998
Springer
15 years 2 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
103
click to vote
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...