On the Complexity of the Montes Ideal Factorization Algorithm

DOI10.1007/978-3-642-14518-6_16MaRDI QIDQ4931648zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• On the deterministic complexity of factoring polynomials
• On the deterministic complexity of factoring polynomials over finite fields
• On the oracle complexity of factoring integers
• On the monotonicity of incomplete factorization
• On the distribution of running times of certain integer factoring algorithms
• On the parameterized complexity of short computation and factorization
• scientific article; zbMATH DE number 799766
• On the acceleration of an algorithm for polynomial factorization
• The complexity of homomorphism factorization
• scientific article; zbMATH DE number 4137244

Cites work

• scientific article; zbMATH DE number 3526799 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over local fields.
• Fast construction of irreducible polynomials over finite fields
• Fast multiplication of large numbers
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Modern computer algebra
• Newton polygons of higher order in algebraic number theory
• On a theorem of Ore
• On fast multiplication of polynomials over arbitrary algebras

Cited in

(10)

• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
• Complexity of OM factorizations of polynomials over local fields
• A new computational approach to ideal theory in number fields
• Single-factor lifting and factorization of polynomials over local fields
• Okutsu-Montes representations of prime ideals of one-dimensional integral closures
• Factoring polynomials over local fields. II
• Plane curve germs and contact factorization
• Computing zero-dimensional tropical varieties via projections
• Local computation of differents and discriminants

Describes a project that uses

Uses Software

• Maple

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931648)