467 search results - page 48 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
174
click to vote
ISSAC
2007
Springer
16 years 10 days ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
127
click to vote
ARITH
2007
IEEE
16 years 16 days ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
137
click to vote
MP
2006
15 years 6 months ago
2006
In this paper, we present a robust optimization formulation for dealing with demand uncertainty in a dynamic pricing and inventory control problem for a make-to-stock manufacturing...
169
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
149
click to vote
JSCIC
2007
15 years 6 months ago
2007
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...