Lacunaryx: Computing bounded-degree factors of lacunary polynomials

Bruno Grenet 1
1 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01163085
Contributor : Bruno Grenet <>
Submitted on : Friday, June 12, 2015 - 9:18:28 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM

Links full text

Identifiers

Collections

Citation

Bruno Grenet. Lacunaryx: Computing bounded-degree factors of lacunary polynomials. ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2015, Issue 194, 49 (4), pp.121-124. ⟨10.1145/2893803.2893807⟩. ⟨lirmm-01163085⟩

Share

Metrics

Record views

185