Quadratic-Time Algorithms for Normal Elements
From MaRDI portal
Recommendations
- Subquadratic-time algorithms for normal bases
- Quadratic-time certificates in linear algebra
- Primitive normalisers in quasipolynomial time
- scientific article; zbMATH DE number 4132307
- Computing absolutely normal numbers in nearly linear time
- scientific article; zbMATH DE number 733559
- A polynomial-time algorithm for computing absolutely normal numbers
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- Polynomial-time normalizers
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
Cited in
(6)
This page was built for publication: Quadratic-Time Algorithms for Normal Elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121105)