_fmpz_poly_tree_alloc, _fmpz_poly_tree_free
Synopsis
#include <flint/fmpz_poly.h>Allocate and free a subproduct tree for len linear factors. Level i of the tree is one array that holds the \lfloor \mathit{len}/2^i \rfloor products of 2^i linear factors, each stored with 2^i + 1 coefficients, followed by the product of the remaining factors if 2^i does not divide len.
Cite this page
The FLINT team, “_fmpz_poly_tree_alloc, _fmpz_poly_tree_free (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_tree_alloc.html (generated 2026-10-20).
@misc{flint-doc-fmpz-poly-fmpz-poly-tree-alloc,
author = {{The FLINT team}},
title = {{\_fmpz\_poly\_tree\_alloc, \_fmpz\_poly\_tree\_free (fmpz\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_tree_alloc.html},
note = {Generated 2026-10-20}
}