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