nmod_mpoly_div_monagan_pearce, nmod_mpoly_divrem_monagan_pearce, nmod_mpoly_divrem_ideal_monagan_pearce
Synopsis
#include <flint/nmod_mpoly.h>void nmod_mpoly_div_monagan_pearce(nmod_mpoly_t Q, const nmod_mpoly_t A, const nmod_mpoly_t B, const nmod_mpoly_ctx_t ctx)sourcevoid nmod_mpoly_divrem_monagan_pearce(nmod_mpoly_t q, nmod_mpoly_t r, const nmod_mpoly_t poly2, const nmod_mpoly_t poly3, const nmod_mpoly_ctx_t ctx)sourcevoid nmod_mpoly_divrem_ideal_monagan_pearce(nmod_mpoly_struct ** Q, nmod_mpoly_t R, const nmod_mpoly_t A, nmod_mpoly_struct * const * B, slong len, const nmod_mpoly_ctx_t ctx)sourceThe heap implementations [MonPea2011] of nmod_mpoly_div, nmod_mpoly_divrem and nmod_mpoly_divrem_ideal, which those functions call.
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, “nmod_mpoly_div_monagan_pearce, nmod_mpoly_divrem_monagan_pearce, nmod_mpoly_divrem_ideal_monagan_pearce (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_div_monagan_pearce.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-div-monagan-pearce,
author = {{The FLINT team}},
title = {{nmod\_mpoly\_div\_monagan\_pearce, nmod\_mpoly\_divrem\_monagan\_pearce, nmod\_mpoly\_divrem\_ideal\_monagan\_pearce (nmod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/nmod_mpoly/nmod_mpoly_div_monagan_pearce.html},
note = {Generated 2026-10-20}
}