n_bpoly_mod_resultant, _n_bpoly_mod_resultant, n_bpoly_mod_resultant_cutoff
#include <flint/nmod_mpoly.h>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)sourcen_bpoly_mod_resultant sets res to the resultant with respect to the main variable y of the bivariate polynomials A and B over \mathbb{F}_p (stored as polynomials in y whose coefficients are polynomials in x), by evaluation at many values of x and interpolation; see Bivariate resultants by evaluation and interpolation. It returns 0, leaving res unchanged, when \mathbb{F}_p does not contain enough suitable points. _n_bpoly_mod_resultant is the same for coefficient arrays with \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 y and number of points.
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-10-20).
@misc{flint-doc-nmod-mpoly-n-bpoly-mod-resultant,
author = {{The FLINT team}},
title = {{n\_bpoly\_mod\_resultant, \_n\_bpoly\_mod\_resultant, n\_bpoly\_mod\_resultant\_cutoff (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/n_bpoly_mod_resultant.html},
note = {Generated 2026-10-20}
}