Counting irreducible polynomials over finite fields
From MaRDI portal
Publication:3073516
DOI10.1007/s10587-010-0055-xzbMath1224.11086OpenAlexW1970269633MaRDI QIDQ3073516
Publication date: 11 February 2011
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/38047
Asymptotic results on counting functions for algebraic and topological structures (11N45) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items (2)
Properties of a Family of Cryptographic Boolean Functions ⋮ An analog of the prime number theorem for finite fields via truncated polylogarithm expansions
Cites Work
This page was built for publication: Counting irreducible polynomials over finite fields