scientific article; zbMATH DE number 4185767
From MaRDI portal
Publication:5750970
zbMath0719.11085MaRDI QIDQ5750970
Publication date: 1990
Full work available at URL: https://eudml.org/doc/72196
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmfinite fieldprimitive elementsasymptotic formulasnumber of primitive polynomialsprimitive pointsirreducible elliptic curve
Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Polynomials over finite fields (11T06)
Related Items (8)
On some approximation problems concerning sparse polynomials over finite fields ⋮ On finding primitive roots in finite fields ⋮ On primitive elements in finite fields of low characteristic ⋮ Counting curves and their projections ⋮ Searching for Primitive Roots in Finite Fields ⋮ The Chebotarev density theorem for function fields -- incomplete intervals ⋮ Finding irreducible and primitive polynomials ⋮ Elements of large order on varieties over prime finite fields
This page was built for publication:
