References
- E. Ballico, M. Elia and M. Sala, On the evaluation of multivariate polynomials over finite fields, J. Symb. Computation 50 (2013), 255–262.
- A. Borodim and I. Munro, The Computational Complexity of Algebraic Numeric Problems, Elsevier Computer, New York, 1975.
- J. Carnicer and M. Gasca, Evaluation of multivariate polynomials and their derivatives, Math. Comp. 54(189) (1990), 231–243. doi: 10.1090/S0025-5718-1990-0993925-1
- C. de Boor and A. Ros, Computational aspects of polynomial interpolation in several variables, Math. Comp. 58(198) (1992), 705–727. doi: 10.1090/S0025-5718-1992-1122061-0
- M. Elia, J. Rosenthal and D. Schipani, Efficient evaluations of polynomials over finite fields, 2011 Australian Communications Theory Workshop, Melbourne (Australia), pp. 154–157, 31 January – 2 February, 2011.
- M. Elia, J. Rosenthal and D. Schipani, Polynomial evaluation over finite fields: new algorithms and complexity bounds, Applicable Algebra in Engineering, Communication and Computing 23(3) (2012), 129–141.
- O. Geil, Evaluation codes from an affine variety code perspective, In: Advances in algebraic geometry codes, Ser. Coding Theory Cryptol., Vol. 5, pp. 153–180, World Sci. Publ., Hackensack, NJ, 2008.
- E. Guerrini and A. Rimoldi, FGLM-like decoding: from Fitzpatrick’s approach to recent developments, Gr̈obner Bases, Coding, and Cryptography, (M. Sala et al., eds.), pp. 197–218, RISC Book Series, Springer, Berlin, 2009.
- S.H. Hansen, Error-correcting codes from higher-dimensional varieties, Finite Fields Appl. 7(4) (2001), 531–552. doi: 10.1006/ffta.2001.0313
- J.B. Little, Algebraic geometry codes from higher dimensional varieties, In: Advances in algebraic geometry codes, Ser. Coding Theory Cryptol., Vol. 5, pp. 257–293, World Sci. Publ., Hackensack, NJ, 2008.
- S.K. Lodha and R. Goldman, A unified approach to evaluation algorithms for multivariate polynomials, Math. Comp. 66(220) (1997), 1521–1553. doi: 10.1090/S0025-5718-97-00862-4
- H.M. Möller and B. Buchberger, The construction of multivariate polynomials with preassigned zeros, LNCS 144 (1982), 24–31.
- T. Mora, The FGLM problem and Moeller’s algorithm on zero-dimensional ideals, Gr̈obner Bases, Coding, and Cryptography, (M. Sala et al., eds.), pp. 27–45, RISC Book Series, Springer, Berlin/Heidelberg, 2009.
- T. Mora, Gr̈obner technology, Gr̈obner Bases, Coding, and Cryptography (M. Sala et al., eds.), pp. 11–25, RISC Book Series, Springer, Berlin/Heidelberg, 2009.
- V.J. Pan, On means of calculating values of polynomials, Uspehi Mat. Nauk 21(1)(127) (1966), 103–134. (Russian)
- M. Paterson and L. Stockmeyer, On the number of Nonscalar Multiplications Necessary to evaluate polynomials, SIAM Journal of Computing 2(1) (1973), 60–66. doi: 10.1137/0202007
- S. Sakata, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. Symbolic Comput. 5(3) (1988), 321–337. doi: 10.1016/S0747-7171(88)80033-6
- S. Sakata, The BMS algorithm and decoding of AG codes, Gr̈obner Bases, Coding, and Cryptography (M. Sala et al., eds.), pp. 165–185, RISC Book Series, Springer, Berlin/Heidelberg, 2009.
- L.L. Schumaker and W. Volk, Efficient evaluation of multivariate polynomials, Computer Aided Geometric Design 3(2) (1986), 149–154. doi: 10.1016/0167-8396(86)90018-X
- S. Winograd, Arithmetic complexity of Computations, SIAM, Pennsylvania, 1980.