fmpz_bpoly_resultant, _fmpz_bpoly_resultant

Set res to the resultant of A and B with respect to x, a polynomial in y, by reduction modulo word-size primes, resultants of the images and Chinese remaindering. If proved is nonzero, enough primes are used for their product to exceed twice a Hadamard-type bound on the coefficients of the resultant, which makes the result exact; otherwise the reconstruction stops once it has been left unchanged by primes whose product exceeds 2^{100}, which is a heuristic. Return 0 if no image could be computed. The underscore version works in place on the coefficient arrays, whose contents it removes, and requires \mathit{lenA} \ge \mathit{lenB} \ge 2. This is the dense case of fmpz_mpoly_resultant and the modular resultant of the generic polynomial module; see Bivariate resultants by evaluation and interpolation.