fmpz_lll_d_with_removal_knapsack
Synopsis
#include <flint/fmpz_lll.h>int fmpz_lll_d_with_removal_knapsack(fmpz_mat_t B, fmpz_mat_t U, const fmpz_t gs_B, const fmpz_lll_t fl)sourceAs fmpz_lll_d_with_removal, but size-reduces each new vector in advance when it is first reached, which is faster for knapsack-type lattices, and tolerates 150 instead of 50 failures of the fast Babai procedure.
Cite this page
The FLINT team, “fmpz_lll_d_with_removal_knapsack (fmpz_lll.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_lll/fmpz_lll_d_with_removal_knapsack.html (generated 2026-10-20).
@misc{flint-doc-fmpz-lll-fmpz-lll-d-with-removal-knapsack,
author = {{The FLINT team}},
title = {{fmpz\_lll\_d\_with\_removal\_knapsack (fmpz\_lll.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_lll/fmpz_lll_d_with_removal_knapsack.html},
note = {Generated 2026-10-20}
}