fmpz_mod_mpoly_mul_johnson
Synopsis
#include <flint/fmpz_mod_mpoly.h>void fmpz_mod_mpoly_mul_johnson(fmpz_mod_mpoly_t A, const fmpz_mod_mpoly_t B, const fmpz_mod_mpoly_t C, const fmpz_mod_mpoly_ctx_t ctx)sourceSets A to B C by Johnson's heap algorithm [Joh1974].
References#
- [Joh1974] S. C. Johnson. Sparse polynomial arithmetic. ACM SIGSAM Bulletin 8:3 (1974), 63–71. https://doi.org/10.1145/1086837.1086847
Cite this page
The FLINT team, “fmpz_mod_mpoly_mul_johnson (fmpz_mod_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_mul_johnson.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-mpoly-fmpz-mod-mpoly-mul-johnson,
author = {{The FLINT team}},
title = {{fmpz\_mod\_mpoly\_mul\_johnson (fmpz\_mod\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_mpoly/fmpz_mod_mpoly_mul_johnson.html},
note = {Generated 2026-10-20}
}