_fmpz_mod_poly_powers_mod_preinv_threaded_pool, fmpz_mod_poly_powers_mod_bsgs
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_powers_mod_preinv_threaded_pool(fmpz ** res, const fmpz * f, slong flen, slong n, const fmpz * g, slong glen, const fmpz * ginv, slong ginvlen, const fmpz_mod_ctx_t ctx, thread_pool_handle * threads, slong num_threads)sourcevoid fmpz_mod_poly_powers_mod_bsgs(fmpz_mod_poly_struct * res, const fmpz_mod_poly_t f, slong n, const fmpz_mod_poly_t g, const fmpz_mod_ctx_t ctx)sourceLike the previous functions, computing the powers with a baby-step giant-step scheme in which blocks of consecutive powers are computed in parallel using the threads of the given thread pool (respectively the threads available through flint_get_num_threads).
Cite this page
The FLINT team, “_fmpz_mod_poly_powers_mod_preinv_threaded_pool, fmpz_mod_poly_powers_mod_bsgs (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_powers_mod_preinv_threaded_pool.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-powers-mod-preinv-threaded-pool,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_powers\_mod\_preinv\_threaded\_pool, fmpz\_mod\_poly\_powers\_mod\_bsgs (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_powers_mod_preinv_threaded_pool.html},
note = {Generated 2026-10-20}
}