A New Algorithm for Fast Generalized DFTs

DOI10.1145/3301313zbMath1454.68194arXiv1707.00349OpenAlexW2989273677WikidataQ126808198 ScholiaQ126808198MaRDI QIDQ4973053

Chloe Ching-Yun Hsu, Chris Umans

Publication date: 2 December 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.00349

zbMATH Keywords

discrete Fourier transformfinite groups of Lie type

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Numerical methods for discrete and fast Fourier transforms (65T50) Simple groups: alternating groups and groups of Lie type (20D06) Computational methods for problems pertaining to group theory (20-08)

This page was built for publication: A New Algorithm for Fast Generalized DFTs