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.
Type de document :
Article dans une revue
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2015, Issue 194, 49 (4), pp.121-124. 〈10.1145/2893803.2893807〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01163085
Contributeur : Bruno Grenet <>
Soumis le : vendredi 12 juin 2015 - 09:18:28
Dernière modification le : jeudi 11 janvier 2018 - 02:07:20

Identifiants

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〉

Partager

Métriques

Consultations de la notice

46