_nmod_poly_mod_matrix_rows_evaluate
Synopsis
#include <flint/nmod_poly.h>void _nmod_poly_mod_matrix_rows_evaluate(nn_ptr res, const nmod_mat_t A, nn_srcptr h, slong n, nn_srcptr poly3, slong len3, nn_srcptr poly3inv, slong len3inv, nmod_t mod)sourceSets (res, n) to \sum_{i} A_i h^i \bmod \mathit{poly3}, where A_i is row i of the d \times n matrix A, h has length n and \mathit{len3} = n + 1. This is the last step of the Brent–Kung algorithm, with h = g^m; it uses Horner's rule for d \le 10 and rectangular splitting otherwise.
Cite this page
The FLINT team, “_nmod_poly_mod_matrix_rows_evaluate (nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_poly/_nmod_poly_mod_matrix_rows_evaluate.html (generated 2026-10-20).
@misc{flint-doc-nmod-poly-nmod-poly-mod-matrix-rows-evaluate,
author = {{The FLINT team}},
title = {{\_nmod\_poly\_mod\_matrix\_rows\_evaluate (nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_poly/_nmod_poly_mod_matrix_rows_evaluate.html},
note = {Generated 2026-10-20}
}