_nmod_mpoly_mul_johnson
Synopsis
#include <flint/nmod_mpoly.h>slong _nmod_mpoly_mul_johnson(nmod_mpoly_t A, const ulong * coeff2, const ulong * exp2, slong len2, const ulong * coeff3, const ulong * exp3, slong len3, flint_bitcnt_t bits, slong N, const ulong * cmpmask, nmod_t fctx)sourceSets A to the product of the term arrays (coeff2, exp2, len2) and (coeff3, exp3, len3), with N words of bits-bit fields per exponent, by Johnson's heap algorithm, and returns the length of the product.
Cite this page
The FLINT team, “_nmod_mpoly_mul_johnson (nmod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/nmod_mpoly/_nmod_mpoly_mul_johnson.html (generated 2026-10-20).
@misc{flint-doc-nmod-mpoly-nmod-mpoly-mul-johnson,
author = {{The FLINT team}},
title = {{\_nmod\_mpoly\_mul\_johnson (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/_nmod_mpoly_mul_johnson.html},
note = {Generated 2026-10-20}
}