Complexity of multivariate polynomial evaluation

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

[1]  John B. Little,et al.  Algebraic geometry codes from higher dimensional varieties , 2008, ArXiv.

[2]  L. L. Schumaker,et al.  Efficient evaluation of multivariate polynomials , 1986, Comput. Aided Geom. Des..

[3]  Larry J. Stockmeyer,et al.  On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..

[4]  M. Gasca,et al.  EVALUATION OF MULTIVARIATE POLYNOMIALS AND THEIR DERIVATIVES , 1990 .

[5]  Ron Goldman,et al.  A unified approach to evaluation algorithms for multivariate polynomials , 1995, Math. Comput..

[6]  S. Hansen,et al.  Error-Correcting Codes from Higher-Dimensional Varieties , 2001 .

[7]  Eleonora Guerrini,et al.  FGLM-Like Decoding: from Fitzpatrick's Approach to Recent Developments , 2009, Gröbner Bases, Coding, and Cryptography.

[8]  Joachim Rosenthal,et al.  Efficient evaluation of polynomials over finite fields , 2011, ArXiv.

[9]  C. D. Boor,et al.  Computational aspects of polynomial interpolation in several variables , 1992 .

[10]  Shojiro Sakata,et al.  The BMS Algorithm and Decoding of AG Codes , 2009, Gröbner Bases, Coding, and Cryptography.

[11]  Shojiro Sakata,et al.  Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array , 1988, J. Symb. Comput..

[12]  Joachim Rosenthal,et al.  Polynomial evaluation over finite fields: new algorithms and complexity bounds , 2011, Applicable Algebra in Engineering, Communication and Computing.

[13]  Joachim Rosenthal,et al.  Efficient evaluations of polynomials over finite fields , 2011, 2011 Australian Communications Theory Workshop.

[14]  Bruno Buchberger,et al.  The Construction of Multivariate Polynomials with Preassigned Zeros , 1982, EUROCAM.