On evaluating multivariate polynomials over finite fields

DOI10.2989/16073606.2015.1023861zbMath1418.11152OpenAlexW2334897773MaRDI QIDQ5233898

Michele Elia, Edoardo Ballico

Publication date: 9 September 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2015.1023861

zbMATH Keywords

complexityfinite fieldsmultivariate polynomialsmultiplicative complexitycomputational algebra

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Cites Work

• Polynomial evaluation over finite fields: new algorithms and complexity bounds
• Efficient evaluation of multivariate polynomials
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Error-correcting codes from higher-dimensional varieties
• On the evaluation of multivariate polynomials over finite fields
• Algebraic geometry codes from higher dimensional varieties
• Gröbner Technology
• The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
• The BMS Algorithm and Decoding of AG Codes
• FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
• Computational Aspects of Polynomial Interpolation in Several Variables
• A unified approach to evaluation algorithms for multivariate polynomials
• Evaluation of Multivariate Polynomials and Their Derivatives
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item