2766 search results - page 141 / 554 » Algorithms for trigonometric polynomials |
121
click to vote
DISOPT
2008
15 years 4 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
104
click to vote
JSC
2006
15 years 4 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
146
click to vote
TCBB
2010
15 years 2 months ago
2010
— We describe a theoretical unifying framework to express comparison of RNA structures, which we call alignment hierarchy. This framework relies on the definition of common supe...
129
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
138
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...