On the evaluation of multivariate polynomials over finite fields

DOI10.1016/J.JSC.2012.07.005MaRDI QIDQ1930170zbMATH OpenOpenAlexFDO

Authors E. Ballico, Michele Elia, Massimiliano Sala

Publication date 10 January 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.2720

zbMATH Keywords

complexityfinite fieldmultiplicative complexitymultivariate polynomialscomputational algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Polynomials in general fields (irreducibility, etc.) (12E05)

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

Cited in

(3)

• Hardness of Reconstructing Multivariate Polynomials over Finite Fields
• On evaluating multivariate polynomials over finite fields
• Evaluation codes and their basic parameters

This page was built for publication: On the evaluation of multivariate polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930170)