On evaluating multivariate polynomials over finite fields
From MaRDI portal
Cites work
- A unified approach to evaluation algorithms for multivariate polynomials
- Algebraic geometry codes from higher dimensional varieties
- Computational Aspects of Polynomial Interpolation in Several Variables
- Efficient evaluation of multivariate polynomials
- Error-correcting codes from higher-dimensional varieties
- Evaluation codes from an affine variety code perspective
- Evaluation of Multivariate Polynomials and Their Derivatives
- FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Gröbner technology
- scientific article; zbMATH DE number 3876580 (Why is no real title available?)
- scientific article; zbMATH DE number 3688713 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3276110 (Why is no real title available?)
- On the evaluation of multivariate polynomials over finite fields
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- The BMS Algorithm and Decoding of AG Codes
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
Cited in
(2)
This page was built for publication: On evaluating multivariate polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233898)
