A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)

DOI10.1006/jsco.1995.1019zbMath0852.68042OpenAlexW2005615533MaRDI QIDQ1897556

Alain Poli

Publication date: 26 November 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1995.1019

zbMATH Keywords

best complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

On the computation of minimal polynomials, cyclic vectors, and Frobenius forms

This page was built for publication: A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)