Amanote Research
Register
Sign In
Finding Irreducible Polynomials Over Finite Fields
doi 10.1145/12130.12166
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1986
Authors
L M Adleman
H W Lenstra
Publisher
ACM Press
Related search
New Algorithms for Finding Irreducible Polynomials Over Finite Fields
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
On the Existence of Irreducible Polynomials With Prescribed Coeffecients Over Finite Fields
Factoring Polynomials Over Finite Fields: A Survey
Journal of Symbolic Computation
Computational Mathematics
Number Theory
Algebra
Deterministic Factorization of Polynomials Over Finite Fields
Polynomials Over Finite Fields: Relationships With Integers and Permutation Polynomials
Permutation Polynomials in Several Variables Over Finite Fields
Proceedings of the Japan Academy
The Number of Irreducible Polynomials Over a Finite Field With Prescribed Coefficients
Deterministic Root Finding Over Finite Fields Using Graeffe Transforms
Applicable Algebra in Engineering, Communications and Computing
Applied Mathematics
Number Theory
Algebra
Composed Product and Factorization of Cyclotomic Polynomials Over Finite Fields