scientific article; zbMATH DE number 4152523
From MaRDI portal
Publication:3481819
Recommendations
Cited in
(19)- Univariate polynomial factorization over finite fields
- Arithmetic of finite fields
- Computational problems in the theory of finite fields
- An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\)
- Classification of finite fields with applications
- Algorithms for finite field arithmetic
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 4153897 (Why is no real title available?)
- Finding Isomorphisms Between Finite Fields
- Some algorithms related to matrices with entries in a finite field
- scientific article; zbMATH DE number 953228 (Why is no real title available?)
- scientific article; zbMATH DE number 3997938 (Why is no real title available?)
- scientific article; zbMATH DE number 6308159 (Why is no real title available?)
- On complexity of the existential and universal theories of finite fields
- Using zeta functions to factor polynomials over finite fields
- The computational complexity of recognizing permutation functions
- Variety evasive subspace families
- Explicit computation of isomorphisms between finite fields
- On arithmetical algorithms over finite fields
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 Q3481819)
