scientific article; zbMATH DE number 5244190
From MaRDI portal
Publication:5446299
Recommendations
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Polynomial evaluation over finite fields: new algorithms and complexity bounds
- The equivariant complexity of multiplication in finite field extensions
- On the complexity of multiplication in finite fields
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
- On the complexity of computing integral bases of function fields
- ALGORITHMS FOR GALOIS GROUP COMPUTATIONS OVER MULTIVARIATE FUNCTION FIELDS
Cited in
(5)- scientific article; zbMATH DE number 1446803 (Why is no real title available?)
- scientific article; zbMATH DE number 5926987 (Why is no real title available?)
- Determining minimized Galois field expressions for ternary functions by using special normal form
- A formal approach to designing multiple-valued arithmetic circuits
- scientific article; zbMATH DE number 3896828 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446299)
