fq_nmod_mpoly_randtest_bound, fq_nmod_mpoly_randtest_bounds, fq_nmod_mpoly_randtest_bits
Synopsis
#include <flint/fq_nmod_mpoly.h>void fq_nmod_mpoly_randtest_bound(fq_nmod_mpoly_t A, flint_rand_t state, slong length, ulong exp_bound, const fq_nmod_mpoly_ctx_t ctx)sourcevoid fq_nmod_mpoly_randtest_bounds(fq_nmod_mpoly_t A, flint_rand_t state, slong length, ulong * exp_bounds, const fq_nmod_mpoly_ctx_t ctx)sourcevoid fq_nmod_mpoly_randtest_bits(fq_nmod_mpoly_t A, flint_rand_t state, slong length, flint_bitcnt_t exp_bits, const fq_nmod_mpoly_ctx_t ctx)sourceSet A to a random polynomial with at most length terms and exponents below exp_bound, below exp_bounds[i] for variable i, or of at most exp_bits bits.
Cite this page
The FLINT team, “fq_nmod_mpoly_randtest_bound, fq_nmod_mpoly_randtest_bounds, fq_nmod_mpoly_randtest_bits (fq_nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_mpoly/fq_nmod_mpoly_randtest_bound.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-mpoly-fq-nmod-mpoly-randtest-bound,
author = {{The FLINT team}},
title = {{fq\_nmod\_mpoly\_randtest\_bound, fq\_nmod\_mpoly\_randtest\_bounds, fq\_nmod\_mpoly\_randtest\_bits (fq\_nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_mpoly/fq_nmod_mpoly_randtest_bound.html},
note = {Generated 2026-10-20}
}