fmpz_mod_mpoly_divides_monagan_pearce, fmpz_mod_mpoly_divides_dense
Synopsis
#include <flint/fmpz_mod_mpoly.h>int fmpz_mod_mpoly_divides_monagan_pearce(fmpz_mod_mpoly_t Q, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)sourceint fmpz_mod_mpoly_divides_dense(fmpz_mod_mpoly_t Q, const fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_ctx_t ctx)sourceVariants of fmpz_mod_mpoly_divides: the heap algorithm of Monagan and Pearce [MonPea2011], and Kronecker substitution, which returns -1 if the dense representation would be too large.
References#
- [MonPea2011] M. Monagan and R. Pearce. Sparse polynomial division using a heap. Journal of Symbolic Computation 46:7 (2011), 807–822. https://doi.org/10.1016/j.jsc.2010.08.014
Cite this page
The FLINT team, “fmpz_mod_mpoly_divides_monagan_pearce, fmpz_mod_mpoly_divides_dense (fmpz_mod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_divides_monagan_pearce.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-mpoly-fmpz-mod-mpoly-divides-monagan-pearce,
author = {{The FLINT team}},
title = {{fmpz\_mod\_mpoly\_divides\_monagan\_pearce, fmpz\_mod\_mpoly\_divides\_dense (fmpz\_mod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_divides_monagan_pearce.html},
note = {Generated 2026-10-20}
}