Homotopy methods for multiplication modulo triangular sets

Simple item page
dc.creatorBostan, Alin
dc.creatorChowdhury, Muhammad
dc.creatorvan der Hoeven, Joris
dc.creatorSchost, Eric
dc.date2009-01-23
dc.date.accessioned2026-07-07T12:33:43Z
dc.date.available2026-07-07T12:33:43Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0901.3657
dc.identifierhttp://arxiv.org/abs/0901.3657
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217227
dc.subjectSymbolic Computation
dc.subjectData Structures and Algorithms
dc.subjectI.1.2
dc.titleHomotopy methods for multiplication modulo triangular sets
dc.typetext

Files

Collections

arXiv