Factoring Polynomials Over Algebraic Number Fields
From MaRDI portal
Publication:4121986
DOI10.1145/355705.355709zbMath0352.12003OpenAlexW2040355635MaRDI QIDQ4121986
Linda Preiss Rothschild, Peter J. Weinberger
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
Related Items
Computing with algebraically closed fields, A modular method for computing the Galois groups of polynomials, Polynomial factorization algorithms over number fields, On finding the largest root of a polynomial, Block Systems of a Galois Group, Computing primitive elements of extension fields, Good reduction of Puiseux series and applications, Factoring polynomials over global fields. I, Approximate factorization of multivariate polynomials and absolute irreducibility testing, Factoring Multivariate Polynomials over Algebraic Number Fields, Optimal algorithm for algebraic factoring, A unified method for multivariate polynomial factorizations, The History of the LLL-Algorithm, The computation of polynomial greatest common divisors over an algebraic number field, Algebraic factoring and geometry theorem proving, Sentences over integral domains and their computational complexities, On computing subfields. A detailed description of the algorithm, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, Simplification of expressions involving radicals, Solvability by radicals is in polynomial time
