Homotopy methods for multiplication modulo triangular sets

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a quasi-linear time complexity for substantial families of examples, for which no such result was known before. Applications are given to notably addition of algebraic numbers in small characteristic.

Keywords

Symbolic Computation, Data Structures and Algorithms, I.1.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/217227

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.3657
 http://arxiv.org/abs/0901.3657

Collections

arXiv