2766 search results - page 22 / 554 » Algorithms for trigonometric polynomials |
ARITH
2007
IEEE
15 years 4 months ago
2007
IEEE
An algorithm for inversion in GF(2m ) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm...
114
Voted
MP
2010
14 years 11 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
110
click to vote
STOC
1998
ACM
15 years 4 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
ISSAC
1999
Springer
15 years 5 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
87
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...