1383 search results - page 38 / 277 » On the Complexity of the Interlace Polynomial |
145
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
176
click to vote
ATAL
2005
Springer
15 years 11 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 ...
108
click to vote
JAT
2010
15 years 4 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 ...
156
click to vote
ISSAC
1998
Springer
15 years 10 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...
195
click to vote
FOCS
1991
IEEE
15 years 9 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...