scientific article
From MaRDI portal
Publication:3754695
zbMath0618.12001MaRDI QIDQ3754695
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycomputational number theoryfactoring of polynomialsfactoring polynomials over number fields
Analysis of algorithms and problem complexity (68Q25) Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) Polynomials over finite fields (11T06) Polynomials (irreducibility, etc.) (11R09) Polynomials (11S05) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (4)
Univariate polynomial factorization over finite fields ⋮ An inequality for the norm of a polynomial factor ⋮ Factoring Multivariate Polynomials over Large Finite Fields ⋮ Bounding the coefficients of a divisor of a given polynomial
This page was built for publication:
