Factoring Polynomials Over Algebraic Number Fields

DOI10.1145/355705.355709MaRDI QIDQ4121986zbMATH OpenOpenAlexFDO

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)

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

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)