_fq_poly_evaluate_fq_vec_fast, fq_poly_evaluate_fq_vec_fast
Synopsis
#include <flint/fq_poly.h>void _fq_poly_evaluate_fq_vec_fast(fq_struct * ys, const fq_struct * poly, slong plen, const fq_struct * xs, slong n, const fq_ctx_t ctx)void fq_poly_evaluate_fq_vec_fast(fq_struct * ys, const fq_poly_t poly, const fq_struct * xs, slong n, const fq_ctx_t ctx)Evaluate at the n points by building the subproduct tree of the points and reducing the polynomial down the tree (Multipoint evaluation and interpolation), at the cost of O(M(n) \log n) operations plus one initial division.
Cite this page
The FLINT team, “_fq_poly_evaluate_fq_vec_fast, fq_poly_evaluate_fq_vec_fast (fq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly/_fq_poly_evaluate_fq_vec_fast.html (generated 2026-10-20).
@misc{flint-doc-fq-poly-fq-poly-evaluate-fq-vec-fast,
author = {{The FLINT team}},
title = {{\_fq\_poly\_evaluate\_fq\_vec\_fast, fq\_poly\_evaluate\_fq\_vec\_fast (fq\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_poly/_fq_poly_evaluate_fq_vec_fast.html},
note = {Generated 2026-10-20}
}