Bivariate factorization using a critical fiber

DOI10.1007/s10208-016-9318-8zbMath1415.13014arXiv1501.03011OpenAlexW1852471559MaRDI QIDQ1683738

Martin Weimann

Publication date: 1 December 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.03011

zbMATH Keywords

complexityalgorithmNewton polytopesingularityfactorizationdiscriminantvaluationresultantbivariate polynomialresiduesHensel lifting

Mathematics Subject Classification ID

Related Items (1)

Computing Puiseux series: a fast divide and conquer algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariants of hypersurface singularities in positive characteristic
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• A lifting and recombination algorithm for rational factorization of sparse polynomials
• A refinement of the Bernštein-Kušnirenko estimate
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
• Factoring polynomials over global fields
• Irreducibility of multivariate polynomials
• The number of roots of a system of equations
• Polyedres de Newton et nombres de Milnor
• Factorization of polynomials and some linear-algebra problems over finite fields
• Irreducibility of polynomials modulo \(p\) via Newton polytopes.
• Irreducibility criterion for germs of analytic functions of two complex variables
• Lifting and recombination techniques for absolute factorization
• Fast separable factorization and applications
• Factoring bivariate polynomials using adjoints
• The algebraic closure of the power series field in positive characteristic
• Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
• Invariants of plane curve singularities and Newton diagrams
• Generalized Newton-Puiseux Theory and Hensel's Lemma in Cx, y
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• Complexity issues in bivariate polynomial factorization
• Factoring multivariate polynomials via partial differential equations
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials

This page was built for publication: Bivariate factorization using a critical fiber