fmpz_mpoly_interp_mcrt_p
Synopsis
#include <flint/fmpz_mpoly_factor.h>int fmpz_mpoly_interp_mcrt_p(flint_bitcnt_t * coeffbits, fmpz_mpoly_t H, const fmpz_mpoly_ctx_t ctx, const fmpz_t m, const nmod_mpoly_t A, const nmod_mpoly_ctx_t ctxp)sourceReplaces , known modulo , by the polynomial with coefficients in the symmetric range modulo that is congruent to modulo and to modulo . and must have the same monomials. Returns whether changed, and sets *coeffbits to the largest bit length of its new coefficients.
Cite this page
The FLINT team, “fmpz_mpoly_interp_mcrt_p (fmpz_mpoly_factor.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_mpoly_interp_mcrt_p.html (generated 2026-11-02).
@misc{flint-doc-fmpz-mpoly-factor-fmpz-mpoly-interp-mcrt-p,
author = {{The FLINT team}},
title = {{fmpz\_mpoly\_interp\_mcrt\_p (fmpz\_mpoly\_factor.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly_factor/fmpz_mpoly_interp_mcrt_p.html},
note = {Generated 2026-11-02}
}