Sciweavers

467 search results - page 48 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 6 months ago
On exact and approximate interpolation of sparse rational functions
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...
Erich Kaltofen, Zhengfeng Yang
ARITH
2007
IEEE
15 years 6 months ago
Worst Cases of a Periodic Function for Large Arguments
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...
Guillaume Hanrot, Vincent Lefèvre, Damien S...
MP
2006
87views more  MP 2006»
14 years 11 months ago
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
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...
Elodie Adida, Georgia Perakis
ICS
2010
Tsinghua U.
15 years 9 months ago
On the Construction of One-Way Functions from Average Case Hardness
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...
Noam Livne
JSCIC
2007
89views more  JSCIC 2007»
14 years 11 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
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...
Bernardo Cockburn, Ryuhei Ichikawa