FLINT3.7.0-dev

_nmod_mpoly_mul_array_chunked_LEX, _nmod_mpoly_mul_array_chunked_DEG, _nmod_mpoly_addmul_array1_ulong1, _nmod_mpoly_addmul_array1_ulong2, _nmod_mpoly_addmul_array1_ulong3

Synopsis#include <flint/nmod_mpoly.h>
void _nmod_mpoly_mul_array_chunked_LEX(nmod_mpoly_t P, const nmod_mpoly_t A, const nmod_mpoly_t B, const ulong * mults, const nmod_mpoly_ctx_t ctx)source
void _nmod_mpoly_mul_array_chunked_DEG(nmod_mpoly_t P, const nmod_mpoly_t A, const nmod_mpoly_t B, ulong degb, const nmod_mpoly_ctx_t ctx)source
void _nmod_mpoly_addmul_array1_ulong1(ulong * poly1, const ulong * poly2, const ulong * exp2, slong len2, const ulong * poly3, const ulong * exp3, slong len3)source
void _nmod_mpoly_addmul_array1_ulong2(ulong * poly1, const ulong * poly2, const ulong * exp2, slong len2, const ulong * poly3, const ulong * exp3, slong len3)source
void _nmod_mpoly_addmul_array1_ulong3(ulong * poly1, const ulong * poly2, const ulong * exp2, slong len2, const ulong * poly3, const ulong * exp3, slong len3)source

Kernels of the array multiplication: the products are accumulated chunk by chunk in arrays of one, two or three words per coefficient, which are reduced modulo n when a chunk is complete.

Cite this page

The FLINT team, “_nmod_mpoly_mul_array_chunked_LEX, _nmod_mpoly_mul_array_chunked_DEG, _nmod_mpoly_addmul_array1_ulong1, _nmod_mpoly_addmul_array1_ulong2, _nmod_mpoly_addmul_array1_ulong3 (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_array_chunked_LEX.html (generated 2026-10-20).