scientific article; zbMATH DE number 1305293

zbMATH Open0949.11053MaRDI QIDQ4252162FDOQ4252162

Authors: H. W. jun. Lenstra 

Publication date: 28 June 2000

Title of this publication is not available (Why is that?)

Recommendations

• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
• scientific article; zbMATH DE number 1305294
• On the factorization of lacunary polynomials
• scientific article; zbMATH DE number 1852134
• scientific article; zbMATH DE number 681099
• Bounded-degree factors of lacunary multivariate polynomials
• scientific article; zbMATH DE number 1305288
• Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
• Factors of low individual degree polynomials
• Factors of low individual degree polynomials

zbMATH Keywords

computational complexityfactorizationMahler measurelacunary polynomials

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Number-theoretic algorithms; complexity (11Y16)

Cited In (21)

• Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
• On testing the divisibility of lacunary polynomials by cyclotomic polynomials
• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
• Diophantine equations with three monomials
• Knapsack and the power word problem in solvable Baumslag–Solitar groups
• Factoring bivariate sparse (lacunary) polynomials
• Sparse bivariate polynomial factorization
• Some speed-ups and speed limits for real algebraic geometry
• Computing sparse multiples of polynomials
• On lacunary polynomial perfect powers
• The number of roots of a lacunary bivariate polynomial on a line
• Computational complexity of sentences over fields
• Root separation for trinomials
• Detecting lacunary perfect powers and computing their roots
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Cyclotomic identity testing and applications
• Intersection multiplicity of a sparse curve and a low-degree curve
• The Diophantine problem for systems of algebraic equations with exponents
• Algorithms for near solutions to polynomial equations
• Lacunaryx: computing bounded-degree factors of lacunary polynomials
• Sublinear root detection and new hardness results for sparse polynomials over finite fields

This page was built for publication:

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