Factoring Polynomials over Algebraic Number Fields
From MaRDI portal
Publication:3679295
DOI10.1137/0214015zbMath0565.12002OpenAlexW2003536029MaRDI QIDQ3679295
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214015
normalgorithmpolynomial complexitycomputational number theoryLenstra-Lenstra- Lovász algorithmpolynomial factorization over algebraic number fields
Polynomials in real and complex fields: factorization (12D05) Polynomials (irreducibility, etc.) (11R09) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (42)
Factoring sparse multivariate polynomials ⋮ Irreducibility of multivariate polynomials ⋮ Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Algebraic geometry of center curves in the moduli space of the cubic maps ⋮ Bounded-degree factors of lacunary multivariate polynomials ⋮ Computer algebra: Past and future ⋮ Inversion in finite fields using logarithmic depth ⋮ Deciding the nilpotency of the Galois group by computing elements in the centre ⋮ Algorithms in Algebraic Number Theory ⋮ The parametrization of canal surfaces and the decomposition of polynomials into a sum of two squares ⋮ An efficient algorithm for factoring polynomials over algebraic extension field ⋮ Factoring bivariate sparse (lacunary) polynomials ⋮ An Algorithm for Determining Torsion Growth of Elliptic Curves ⋮ -adic images of Galois for elliptic curves over (and an appendix with John Voight) ⋮ On the normalization of numbers and functions defined by radicals ⋮ Factorization and root-finding for polynomials over division quaternion algebras ⋮ Irrational Quantum Walks ⋮ Computing primitive elements of extension fields ⋮ Algorithms for sentences over integral domains ⋮ Detecting lacunary perfect powers and computing their roots ⋮ Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators ⋮ Computation of unirational fields ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Computational complexity of sentences over fields ⋮ Polynomial time algorithms for sentences over number fields ⋮ Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\) ⋮ Decomposition of algebras over finite fields and number fields ⋮ List decoding of number field codes ⋮ Galois group computation for rational polynomials ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ The computation of polynomial greatest common divisors over an algebraic number field ⋮ Decidable fragments of field theories ⋮ A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function ⋮ Irreducibility testing over local fields ⋮ Algebraic factoring and geometry theorem proving ⋮ Decidable Sentences Over Polynomial Rings ⋮ The number of roots of a lacunary bivariate polynomial on a line ⋮ Sentences over integral domains and their computational complexities ⋮ On computing subfields. A detailed description of the algorithm ⋮ Solvability by radicals is in polynomial time ⋮ Algebraic reduction methods and their applications to matrix continued fractions
This page was built for publication: Factoring Polynomials over Algebraic Number Fields
