Factoring Polynomials over Algebraic Number Fields
From MaRDI portal
Recommendations
Cited in
(58)- The number of roots of a lacunary bivariate polynomial on a line
- Factoring polynomials over global fields
- Solvability by radicals is in polynomial time
- Factoring sparse multivariate polynomials
- Irreducibility of multivariate polynomials
- Computer algebra: Past and future
- Polynomial time algorithms for sentences over number fields
- Sentences over integral domains and their computational complexities
- On computing subfields. A detailed description of the algorithm
- Algebraic geometry of center curves in the moduli space of the cubic maps
- On the normalization of numbers and functions defined by radicals
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Factorization of polynomials over valued fields based on graded polynomials
- Efficiently factoring polynomials modulo \(p^4\)
- List decoding of number field codes
- Factoring polynomials over global fields. II.
- Computation of unirational fields
- Bounded-degree factors of lacunary multivariate polynomials
- Inversion in finite fields using logarithmic depth
- Computing all factorizations in \(\mathbb{Z}_N[x]\)
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- Erratum: Factoring Polynomials over Algebraic Number Fields
- An efficient algorithm for factoring polynomials over algebraic extension field
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Decidable Sentences Over Polynomial Rings
- Factoring with Cyclotomic Polynomials
- Algorithms in Algebraic Number Theory
- A polynomial reduction algorithm
- scientific article; zbMATH DE number 1253993 (Why is no real title available?)
- scientific article; zbMATH DE number 1254268 (Why is no real title available?)
- Single-factor lifting and factorization of polynomials over local fields
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
- Deciding the nilpotency of the Galois group by computing elements in the centre
- 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
- \(\ell\)-adic images of Galois for elliptic curves over \(\mathbb{Q}\)(and an appendix with John Voight)
- scientific article; zbMATH DE number 3893305 (Why is no real title available?)
- Decidable fragments of field theories
- Algebraic factoring and geometry theorem proving
- The computation of polynomial greatest common divisors over an algebraic number field
- Algebraic reduction methods and their applications to matrix continued fractions
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Factoring polynomials over special finite fields
- Galois group computation for rational polynomials
- Kronecker's and Newton's approaches to solving: a first comparison
- Factoring polynomials over local fields.
- The parametrization of canal surfaces and the decomposition of polynomials into a sum of two squares
- An Algorithm for Determining Torsion Growth of Elliptic Curves
- Factorization and root-finding for polynomials over division quaternion algebras
- Irrational Quantum Walks
- Detecting lacunary perfect powers and computing their roots
- Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
- Decomposition of algebras over finite fields and number fields
- Factoring bivariate sparse (lacunary) polynomials
- Computing primitive elements of extension fields
- Algorithms for sentences over integral domains
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Computational complexity of sentences over 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 Q3679295)
