2766 search results - page 115 / 554 » Algorithms for trigonometric polynomials |
121
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
135
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
120
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
104
click to vote
COCO
1993
Springer
15 years 8 months ago
1993
Springer
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
115
click to vote
JSC
2007
15 years 3 months ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...