Pages that link to "Item:Q4121986"

The following pages link to Factoring Polynomials Over Algebraic Number Fields (Q4121986):

Displaying 21 items.

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