1998 search results - page 62 / 400 » Complexity of the Cover Polynomial |
162
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...
199
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...
175
click to vote
CORR
2010
Springer
15 years 6 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...
182
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper, we propose a new method for face detection from cluttered images. We use a polynomial neural network (PNN) for separation of face and non-face patterns while the co...
100
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...