Lacunaryx: computing bounded-degree factors of lacunary polynomials. In this paper, we report on an implementation in the free software Mathemagix of lacunary factorization algorithms, distributed as a library called Lacunaryx. These algorithms take as input a polynomial in sparse representation, that is as a list of nonzero monomials, and an integer d, and compute its irreducible degree-≤d factors. The complexity of these algorithms is polynomial in the sparse size of the input polynomial and d.
Keywords for this software
References in zbMATH (referenced in 4 articles , 2 standard articles )
Showing results 1 to 4 of 4.
- Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann: Computing the multilinear factors of lacunary polynomials without heights (2021)
- Grenet, Bruno: Bounded-degree factors of lacunary multivariate polynomials (2016)
- Bruno Grenet: Lacunaryx: Computing bounded-degree factors of lacunary polynomials (2015) arXiv
- Grenet, Bruno: Lacunaryx: computing bounded-degree factors of lacunary polynomials (2015)