scientific article; zbMATH DE number 1305293

zbMath0949.11053MaRDI QIDQ4252162

Hendrik W. jun. Lenstra

Publication date: 28 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityMahler measurefactorizationlacunary polynomials

Mathematics Subject Classification ID

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

Related Items (16)

Algorithms for near solutions to polynomial equations ⋮ Factoring bivariate sparse (lacunary) polynomials ⋮ Diophantine equations with three monomials ⋮ The Diophantine problem for systems of algebraic equations with exponents ⋮ Computing sparse multiples of polynomials ⋮ Knapsack and the power word problem in solvable Baumslag–Solitar groups ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Detecting lacunary perfect powers and computing their roots ⋮ Sparse bivariate polynomial factorization ⋮ Computational complexity of sentences over fields ⋮ Root separation for trinomials ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ Intersection multiplicity of a sparse curve and a low-degree curve ⋮ Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields ⋮ The number of roots of a lacunary bivariate polynomial on a line ⋮ Some speed-ups and speed limits for real algebraic geometry

This page was built for publication: