Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields

DOI10.1145/1145768.1145798zbMath1356.11093OpenAlexW2060589377MaRDI QIDQ2958982

Erich L. Kaltofen, Pascal Koiran

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1145768.1145798

zbMATH Keywords

heightpolynomial factorizationmultivariate polynomialsalgebraic numberspolynomial-time complexitysparse polynomialslacunary polynomialsLang conjecture

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (10)

Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations ⋮ Bounded-degree factors of lacunary multivariate polynomials ⋮ Factoring bivariate sparse (lacunary) polynomials ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Lacunaryx ⋮ Detecting lacunary perfect powers and computing their roots ⋮ Sparse bivariate polynomial factorization ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Factorization of bivariate sparse polynomials ⋮ The number of roots of a lacunary bivariate polynomial on a line

This page was built for publication: Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields