FLINT3.7.0-dev

_fq_poly_sqr_classical, fq_poly_sqr_classical, _fq_poly_sqr_KS, fq_poly_sqr_KS, _fq_poly_sqr_reorder, fq_poly_sqr_reorder

Synopsis#include <flint/fq_poly.h>
void _fq_poly_sqr_classical(fq_struct * rop, const fq_struct * op, slong len, const fq_ctx_t ctx)
void fq_poly_sqr_classical(fq_poly_t rop, const fq_poly_t op, const fq_ctx_t ctx)
void _fq_poly_sqr_KS(fq_struct * rop, const fq_struct * op, slong len, const fq_ctx_t ctx)
void fq_poly_sqr_KS(fq_poly_t rop, const fq_poly_t op, const fq_ctx_t ctx)
void _fq_poly_sqr_reorder(fq_struct * rop, const fq_struct * op, slong len, const fq_ctx_t ctx)source
void fq_poly_sqr_reorder(fq_poly_t rop, const fq_poly_t op, const fq_ctx_t ctx)source

Squaring with a fixed algorithm: classical, Kronecker substitution, or reordering of the variables (see fq_poly_mul_reorder). The underscore versions write 2 * len - 1 coefficients; the classical version does not allow aliasing.

Cite this page

The FLINT team, “_fq_poly_sqr_classical, fq_poly_sqr_classical, _fq_poly_sqr_KS, fq_poly_sqr_KS, _fq_poly_sqr_reorder, fq_poly_sqr_reorder (fq_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_poly/_fq_poly_sqr_classical.html (generated 2026-10-20).