Lacunaryx

DOI10.1145/2893803.2893807zbMath1365.68490arXiv1506.03726OpenAlexW2204038728MaRDI QIDQ5270184

Bruno Grenet

Publication date: 22 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Related Items (2)

Computing the multilinear factors of lacunary polynomials without heights ⋮ Lacunaryx

Uses Software

• Mathemagix

Cites Work

• A polynomial time algorithm for diophantine equations in one variable
• Bounded-degree factors of lacunary multivariate polynomials
• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
• Factoring bivariate lacunary polynomials without heights
• Computing low-degree factors of lacunary polynomials
• On the complexity of factoring bivariate supersparse (Lacunary) polynomials

This page was built for publication: Lacunaryx