scientific article; zbMATH DE number 4069018

MaRDI QIDQ3801671zbMATH OpenFDO

Authors John Abbott, Russell Bradford, James H. Davenport

Publication date 1988

zbMATH Keywords

Bibliographyfactoring algorithm over algebraic number fieldsfactorizing polynomials with algebraic integer coefficients.Zbl 0635.00018Hensel's lemma

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Polynomials (irreducibility, etc.) (11R09) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• scientific article; zbMATH DE number 1276815
• Factoring polynomials with rational coefficients
• Factoring Multivariate Polynomials over Algebraic Number Fields
• scientific article; zbMATH DE number 3858405
• scientific article; zbMATH DE number 3860385

Cited in

(16)

• On polynomial factorization
• Algorithms related to the decomposition of polynomials
• Incomplete factorization and GCD techniques
• Polynomial factorization algorithms over number fields
• Slip and slide method of factoring trinomials with integer coefficients over the integers
• scientific article; zbMATH DE number 1799292 (Why is no real title available?)
• scientific article; zbMATH DE number 4145747 (Why is no real title available?)
• An efficient algorithm for factoring polynomials over algebraic extension field
• Factoring Polynomials over Algebraic Number Fields
• Factoring with Cyclotomic Polynomials
• scientific article; zbMATH DE number 15339 (Why is no real title available?)
• Factorization of Prime Ideal Extensions in Number Rings
• scientific article; zbMATH DE number 1276815 (Why is no real title available?)
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Newton polygons of higher order in algebraic number theory
• Polynomial factorization: Sharp bounds, efficient algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801671)