Lacunaryx: Computing bounded-degree factors of lacunary polynomials - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles ACM Communications in Computer Algebra Year : 2015

Lacunaryx: Computing bounded-degree factors of lacunary polynomials

Bruno Grenet

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.

Dates and versions

lirmm-01163085 , version 1 (12-06-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More