✦ LIBER ✦

Massively parallel factorizations of polynomials with many non-commuting variables

✍ Scribed by Jean-Christophe Hohl

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 418 KB
Volume: 172
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00108-9

No coin nor oath required. For personal study only.

✦ Synopsis

We give here an effective massively parallel algorithm allowing factorization of polynomials with non-commuting variables and integer coefficients.

This algorithm is built upon the hypercube representation of many-variable polynomials introduced by Beauzamy-Frot-Millou [l], and implemented on the Connection Machine CM200. It allows full use of the massively parallel programmation of the CM200.