2766 search results - page 79 / 554 » Algorithms for trigonometric polynomials |
111
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
131
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
137
click to vote
JSC
2008
15 years 3 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
137
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
165
click to vote
FOCS
1991
IEEE
15 years 7 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...