FLINT3.7.0-dev
/

n_bpoly_mod_resultant, _n_bpoly_mod_resultant, n_bpoly_mod_resultant_cutoff

Synopsis#include <flint/nmod_mpoly.h>
int n_bpoly_mod_resultant(n_poly_t res, const n_bpoly_t A, const n_bpoly_t B, nmod_t mod)source
int _n_bpoly_mod_resultant(n_poly_t res, const n_poly_struct * A, slong lenA, const n_poly_struct * B, slong lenB, nmod_t mod)source
int n_bpoly_mod_resultant_cutoff(slong lenA, slong lenB, slong npoints)source

n_bpoly_mod_resultant sets res to the resultant with respect to the main variable yy of the bivariate polynomials A and B over Fp\mathbb{F}_p (stored as polynomials in yy whose coefficients are polynomials in xx), by evaluation at many values of xx and interpolation; see Bivariate resultants by evaluation and interpolation. It returns 0, leaving res unchanged, when Fp\mathbb{F}_p does not contain enough suitable points. _n_bpoly_mod_resultant is the same for coefficient arrays with lenA≥lenB≥2\mathit{lenA} \ge \mathit{lenB} \ge 2 and nonzero leading coefficients. n_bpoly_mod_resultant_cutoff returns whether this method is expected to beat the subresultant algorithm for the given lengths in yy and number of points.

Cite this page

The FLINT team, “n_bpoly_mod_resultant, _n_bpoly_mod_resultant, n_bpoly_mod_resultant_cutoff (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/n_bpoly_mod_resultant.html (generated 2026-11-02).