scientific article
From MaRDI portal
Publication:4038771
zbMath0772.11048MaRDI QIDQ4038771
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityfinite fieldBerlekamp-Massey algorithmirreducible polynomialsprimitive polynmials
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (4)
Elimination ideal and bivariate resultant over finite fields ⋮ A fast algorithm to compute irreducible and primitive polynomials in finite fields ⋮ Fast computation of special resultants ⋮ Fast arithmetic in unramified \(p\)-adic fields
This page was built for publication:
