Computer Science – Symbolic Computation
Scientific paper
2009-01-23
Computer Science
Symbolic Computation
Scientific paper
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.
Bostan Alin
Chowdhury Muhammad
der Hoeven Joris van
Schost Éric
No associations
LandOfFree
Homotopy methods for multiplication modulo triangular sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Homotopy methods for multiplication modulo triangular sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homotopy methods for multiplication modulo triangular sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-65934