2 citations · 3 across the 13 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2023
Beating binary powering for polynomial matrices
Alin Bostan, Vincent Neiger, Sergey Yurkevich
The th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~. When Fast Fourier…
cs.SC2020
Fast Computation of the -th Term of a -Holonomic Sequence and Applications
Alin Bostan, Sergey Yurkevich
In 1977, Strassen invented a famous baby-step/giant-step algorithm that computes the factorial in arithmetic complexity quasi-linear in . In 1988, the Chudnovsky bro…