Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
From MaRDI portal
Publication:3356389
DOI10.1016/0196-6774(91)90015-QzbMath0731.11068OpenAlexW2010243960MaRDI QIDQ3356389
Publication date: 1991
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(91)90015-q
finite fieldgeneralized Riemann hypothesispolynomial factorizationprime decomposition in number fields
Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Algebraic numbers; rings of algebraic integers (11R04)
Related Items (4)
Univariate polynomial factorization over finite fields ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Factoring polynomials over finite fields: A survey ⋮ Unnamed Item
This page was built for publication: Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields