Complexity of multivariate polynomial evaluation
Edoardo Ballico, Michele Elia, Massimiliano Sala
TL;DR
This paper introduces a method for evaluating multivariate polynomials over finite fields and analyzes its multiplicative complexity, providing insights into the computational efficiency of such evaluations.
Contribution
It presents a novel evaluation method and discusses its multiplicative complexity, advancing understanding of computational costs in polynomial evaluation over finite fields.
Findings
Evaluation method with specific complexity bounds
Analysis of multiplicative complexity in polynomial evaluation
Potential implications for computational algebra
Abstract
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.