fq_zech_mpoly_mul, fq_zech_mpoly_mul_johnson
Synopsis
#include <flint/fq_zech_mpoly.h>void fq_zech_mpoly_mul(fq_zech_mpoly_t A, const fq_zech_mpoly_t B, const fq_zech_mpoly_t C, const fq_zech_mpoly_ctx_t ctx)sourcevoid fq_zech_mpoly_mul_johnson(fq_zech_mpoly_t poly1, const fq_zech_mpoly_t poly2, const fq_zech_mpoly_t poly3, const fq_zech_mpoly_ctx_t ctx)sourceSet 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, “fq_zech_mpoly_mul, fq_zech_mpoly_mul_johnson (fq_zech_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech_mpoly/fq_zech_mpoly_mul.html (generated 2026-10-20).
@misc{flint-doc-fq-zech-mpoly-fq-zech-mpoly-mul,
author = {{The FLINT team}},
title = {{fq\_zech\_mpoly\_mul, fq\_zech\_mpoly\_mul\_johnson (fq\_zech\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_zech_mpoly/fq_zech_mpoly_mul.html},
note = {Generated 2026-10-20}
}