522 citations · 2.3k across the 64 of their papers we have counts for
1 paper · 1 filter
Markus Pueschel, Martin Roetteler, Thomas Beth
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being…