2976 search results - page 250 / 596 » On the bounded integer programming |
129
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
144
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
190
Voted
ISMVL
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper considers representations for elementary functions such as polynomial, trigonometric, logarithmic, square root, and reciprocal functions. These real valued functions ar...
129
Voted
WCC
2005
Springer
15 years 10 months ago
2005
Springer
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
154
Voted
ANTS
2004
Springer
15 years 10 months ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...