scientific article
From MaRDI portal
Publication:3140455
zbMath0820.11078MaRDI QIDQ3140455
Publication date: 9 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmfinite fieldirreducible polynomialalgorithms for testing irreducibilitycomputing minimal polynomialsfactoring cyclotomic polynomials
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (3)
Computing Frobenius maps and factoring polynomials ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Fast construction of irreducible polynomials over finite fields
This page was built for publication: