69 search results - page 4 / 14 » The nearest polynomial of lower degree |
JSC
2010
13 years 6 months ago
2010
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
ADCM
2008
13 years 6 months ago
2008
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
ECCC
2010
13 years 6 months ago
2010
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...
CAGD
2006
13 years 7 months ago
2006
We show that many rational parametric curves can be interpolated, in a Hermite sense, by polynomial curves whose degree, relative to the number of data being interpolated, is lowe...