Factoring Polynomials Over Algebraic Number Fields

DOI10.1145/355705.355709MaRDI QIDQ4121986zbMATHOpenAlexFDO

Authors Peter J. Weinberger, Linda Preiss Rothschild

Publication date 1976

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355705.355709

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Polynomials (11S05)

Cited in

(21)

• On finding the largest root of a polynomial
• The computation of polynomial greatest common divisors over an algebraic number field
• A modular method for computing the Galois groups of polynomials
• The history of the LLL-algorithm
• Simplification of expressions involving radicals
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Block Systems of a Galois Group
• Solvability by radicals is in polynomial time
• Computing with algebraically closed fields
• Polynomial factorization algorithms over number fields
• Algebraic factoring and geometry theorem proving
• A unified method for multivariate polynomial factorizations
• Optimal algorithm for algebraic factoring
• Factoring polynomials over global fields. I
• Sentences over integral domains and their computational complexities
• Using the interval-symbol method with zero rewriting to factor polynomials over algebraic number fields
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Computing primitive elements of extension fields
• Good reduction of Puiseux series and applications
• On computing subfields. A detailed description of the algorithm

This page was built for publication: Factoring Polynomials Over Algebraic Number Fields

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