To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables. Here we present a new technique, based on Rutishauser’s qd-algorithm, in which we overcome both drawbacks
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
In this paper, we consider the problem of interpolating univariate polynomials over a field of chara...
We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse rep...
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the e...
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
AbstractWe consider the problem of sparse interpolation of an approximate multivariate black-box pol...
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial ...
The problem of interpolating a sparse polynomial has always been one of the central objects of resea...
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial ...
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial ...
Abstract. We consider the problem of interpolating sparse multivariate polynomials from their values...
A fundamental technique used by many algorithms in computer algebra is interpolating polynomials fro...
A fundamental technique used by many algorithms in computer algebrais interpolating polynomials from...
AbstractConsider the black box interpolation of a τ-sparse, n-variate rational function f, where τ i...
A fundamental technique used by many algorithms in computer algebra is interpolating polynomials fr...
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
In this paper, we consider the problem of interpolating univariate polynomials over a field of chara...
We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse rep...
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the e...
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
AbstractWe consider the problem of sparse interpolation of an approximate multivariate black-box pol...
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial ...
The problem of interpolating a sparse polynomial has always been one of the central objects of resea...
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial ...
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial ...
Abstract. We consider the problem of interpolating sparse multivariate polynomials from their values...
A fundamental technique used by many algorithms in computer algebra is interpolating polynomials fro...
A fundamental technique used by many algorithms in computer algebrais interpolating polynomials from...
AbstractConsider the black box interpolation of a τ-sparse, n-variate rational function f, where τ i...
A fundamental technique used by many algorithms in computer algebra is interpolating polynomials fr...
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
In this paper, we consider the problem of interpolating univariate polynomials over a field of chara...
We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse rep...
DOI
Add to ORKG