scientific article; zbMATH DE number 953228

MaRDI QIDQ4718174zbMATH OpenFDO

Authors Igor E. Shparlinski

Publication date 19 August 1997

zbMATH Keywords

algorithmsapproximate constructions in finite fieldsconstruction of a primitive rootirreducible polynomial

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Cited in

(5)

• Polynomial distribution and sequences of irreducible polynomials over finite fields
• The arithmetic of consecutive polynomial sequences over finite fields
• Elements of large order on varieties over prime finite fields
• On primitive elements in finite fields of low characteristic
• Finite field constructions of combinatorial arrays

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 Q4718174)