On the Complexity of the Montes Ideal Factorization Algorithm

DOI10.1007/978-3-642-14518-6_16zbMath1260.11085OpenAlexW1517477680MaRDI QIDQ4931648

No author found.

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14518-6_16

zbMATH Keywords

complexity of polynomial factorizationMontes ideal factorization algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (7)

Computing zero-dimensional tropical varieties via projections ⋮ A new computational approach to ideal theory in number fields ⋮ 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 ⋮ Local computation of differents and discriminants ⋮ Factoring Polynomials over Local Fields II ⋮ Okutsu-Montes representations of prime ideals of one-dimensional integral closures

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• On a theorem of Ore
• On fast multiplication of polynomials over arbitrary algebras
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Fast multiplication of large numbers
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Newton polygons of higher order in algebraic number theory
• Factoring Polynomials Over Large Finite Fields
• Fast construction of irreducible polynomials over finite fields
• Factoring polynomials over local fields.

This page was built for publication: On the Complexity of the Montes Ideal Factorization Algorithm