arXiv Open Access 2009

Homotopy methods for multiplication modulo triangular sets

Alin Bostan Muhammad Chowdhury Joris van der Hoeven Eric Schost

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.SC cs.DS

Penulis (4)

Alin Bostan

Muhammad Chowdhury

Joris van der Hoeven

Eric Schost

Format Sitasi

APA MLA BibTeX

Bostan, A., Chowdhury, M., Hoeven, J.v.d., Schost, E. (2009). Homotopy methods for multiplication modulo triangular sets. https://arxiv.org/abs/0901.3657

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2009
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓