scientific article
From MaRDI portal
Publication:3481819
zbMath0703.11076MaRDI QIDQ3481819
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveycomplexityisomorphismsgeneralized Riemann hypothesisdeterministic algorithmsprobabilistic algorithmsfactorizationirreducibilityconstructing finite fields
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Finite fields and commutative rings (number-theoretic aspects) (11T99) Polynomials over finite fields (11T06) Algebraic number theory computations (11Y40)
Related Items (2)
Univariate polynomial factorization over finite fields ⋮ Using zeta functions to factor polynomials over finite fields
This page was built for publication: