mpoly_search_monomials
Synopsis
#include <flint/mpoly.h>void mpoly_search_monomials(slong ** e_ind, ulong * e, slong * e_score, slong * t1, slong * t2, slong * t3, slong lower, slong upper, const ulong * a, slong a_len, const ulong * b, slong b_len, slong N, const ulong * cmpmask)sourceSplits the products of two sorted monomial arrays for parallel multiplication. Finds a monomial e such that the number of products a_i b_j \le e is between lower and upper (or as close as possible), stores this number in e_score, and sets *e_ind to one of the work arrays t1, t2, t3 (each of length a_len): entry i of it is the first index j with a_i b_j \le e. Assumes that 1 is the smallest monomial.
Cite this page
The FLINT team, “mpoly_search_monomials (mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/mpoly/mpoly_search_monomials.html (generated 2026-10-20).
@misc{flint-doc-mpoly-mpoly-search-monomials,
author = {{The FLINT team}},
title = {{mpoly\_search\_monomials (mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/mpoly/mpoly_search_monomials.html},
note = {Generated 2026-10-20}
}