International audienceThe evaluation of a polynomial at several points is called the problem of multi-point evaluation. Sometimes, the set of evaluation points is fixed and several polynomials need to be evaluated at this set of points. Several efficient algorithms for this kind of "amortized" multi-point evaluation have been developed recently for the special cases of bivariate polynomials or when the set of evaluation points is generic. In this paper, we extend these results to the evaluation of polynomials in an arbitrary number of variables at an arbitrary set of points. We prove a softly linear complexity bound when the number of variables is fixed
Some evaluation methods of multivariate polynomials over finite fields are described and their multi...
Some evaluation methods of multivariate polynomials over finite fields are described and their multi...
A method to evaluate multivariate polynomials over a finite field is described and its multiplicativ...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceIn 2008, Kedlaya and Umans designed the first multivariate multi-point evaluat...
International audienceIn 2008, Kedlaya and Umans designed the first multivariate multi-point evaluat...
International audienceIn 2008, Kedlaya and Umans designed the first multivariate multi-point evaluat...
In 2008, Kedlaya and Umans designed the first multivariate multi-point evaluation algorithm over fin...
Some evaluation methods of multivariate polynomials over finite fields are described and their multi...
Some evaluation methods of multivariate polynomials over finite fields are described and their multi...
A method to evaluate multivariate polynomials over a finite field is described and its multiplicativ...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceThe efficient evaluation of multivariate polynomials at many points is an impo...
International audienceIn 2008, Kedlaya and Umans designed the first multivariate multi-point evaluat...
International audienceIn 2008, Kedlaya and Umans designed the first multivariate multi-point evaluat...
International audienceIn 2008, Kedlaya and Umans designed the first multivariate multi-point evaluat...
In 2008, Kedlaya and Umans designed the first multivariate multi-point evaluation algorithm over fin...
Some evaluation methods of multivariate polynomials over finite fields are described and their multi...
Some evaluation methods of multivariate polynomials over finite fields are described and their multi...
A method to evaluate multivariate polynomials over a finite field is described and its multiplicativ...