Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
From MaRDI portal
Publication:2958982
Recommendations
- On the complexity of factoring bivariate supersparse (lacunary) polynomials
- Factoring bivariate sparse (lacunary) polynomials
- scientific article; zbMATH DE number 1305293
- Computing the multilinear factors of lacunary polynomials without heights
- Lacunaryx: computing bounded-degree factors of lacunary polynomials
Cited in
(13)- On the complexity of factoring bivariate supersparse (lacunary) polynomials
- Factoring bivariate sparse (lacunary) polynomials
- Factorization of bivariate sparse polynomials
- Computing the multilinear factors of lacunary polynomials without heights
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Lacunaryx: computing bounded-degree factors of lacunary polynomials
- The number of roots of a lacunary bivariate polynomial on a line
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- scientific article; zbMATH DE number 1305293 (Why is no real title available?)
- Detecting lacunary perfect powers and computing their roots
- Bounded-degree factors of lacunary multivariate polynomials
- Sparse bivariate polynomial factorization
- Cyclotomic identity testing and applications
This page was built for publication: Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958982)