Amanote Research

Amanote Research

    RegisterSign 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 AdlemanH W Lenstra
Publisher

ACM Press


Related search

New Algorithms for Finding Irreducible Polynomials Over Finite Fields

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

On the Existence of Irreducible Polynomials With Prescribed Coeffecients Over Finite Fields

English

Factoring Polynomials Over Finite Fields: A Survey

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2001English

Deterministic Factorization of Polynomials Over Finite Fields

English

Polynomials Over Finite Fields: Relationships With Integers and Permutation Polynomials

English

Permutation Polynomials in Several Variables Over Finite Fields

Proceedings of the Japan Academy
1970English

The Number of Irreducible Polynomials Over a Finite Field With Prescribed Coefficients

English

Deterministic Root Finding Over Finite Fields Using Graeffe Transforms

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
2015English

Composed Product and Factorization of Cyclotomic Polynomials Over Finite Fields

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy