Complexity of multivariate polynomial evaluation

Abstract

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

References in corpus (1)

• Efficient evaluation of polynomials over finite fields

Cited by in corpus (3)

• Reduced Order and Surrogate Models for Gravitational Waves
• Symmetric Private Polynomial Computation From Lagrange Encoding
• Triangular polynomial maps in characteristic $p$