Algorithms for finite field arithmetic
From MaRDI portal
Recommendations
Cited in
(15)- Basic algorithms for rational function fields
- Finite integer computations: An algebraic foundation for their correctness
- Dense Arithmetic over Finite Fields with the CUMODP Library
- Fast arithmetics in Artin-Schreier towers over finite fields
- Fast algorithms for -adic towers over finite fields
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 459045 (Why is no real title available?)
- Fast arithmetic for the algebraic closure of finite fields
- scientific article; zbMATH DE number 4153897 (Why is no real title available?)
- Efficient Finite Fields in the Maxima Computer Algebra System
- Fast arithmetics in Artin-Schreier towers over finite fields
- Computing isomorphisms and embeddings of finite fields
- Lattices of compatibly embedded finite fields in Nemo/Flint
- scientific article; zbMATH DE number 6308159 (Why is no real title available?)
- On arithmetical algorithms over finite fields
This page was built for publication: Algorithms for finite field arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819730)