fq_reduce
Synopsis
#include <flint/fq.h>Reduces the integer polynomial rop, with arbitrary integer coefficients, modulo p and modulo the defining polynomial, in place, so that it becomes a valid element. The length of rop must be at most 2d unless the defining polynomial is sparse (see below); products of two elements satisfy this.
Cite this page
The FLINT team, “fq_reduce (fq.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq/fq_reduce.html (generated 2026-10-20).
@misc{flint-doc-fq-fq-reduce,
author = {{The FLINT team}},
title = {{fq\_reduce (fq.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq/fq_reduce.html},
note = {Generated 2026-10-20}
}