2766 search results - page 133 / 554 » Algorithms for trigonometric polynomials |
135
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
157
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
165
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
160
click to vote
MOC
1998
15 years 3 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
113
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...