Computing low-degree factors of lacunary polynomials

DOI10.1145/2608628.2608649zbMath1325.68284arXiv1401.4720OpenAlexW3098163749MaRDI QIDQ3452398

Bruno Grenet

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

Newton polygonpolynomial factorizationPuiseux seriesWronskian determinantmultivariate lacunary polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items

Bounded-degree factors of lacunary multivariate polynomials ⋮ Lacunaryx ⋮ Computing the multilinear factors of lacunary polynomials without heights

Uses Software

• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing low-degree factors of lacunary polynomials