📚
📚
The Cartographer
Fast generalized DFTs for all finite groups
January 08, 2019 · Declared Dead · 🏛 IEEE Annual Symposium on Foundations of Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Chris Umans
arXiv ID
1901.02536
Category
cs.DS: Data Structures & Algorithms
Cross-listed
math.GR
Citations
5
Venue
IEEE Annual Symposium on Foundations of Computer Science
Last Checked
4 months ago
Abstract
For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{ω/2 + ε})$ operations, for any $ε> 0$. Here, $ω$ is the exponent of matrix multiplication.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Data Structures & Algorithms
R.I.P.
👻
Ghosted
Route Planning in Transportation Networks
R.I.P.
👻
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
👻
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
👻
Ghosted
Graph Isomorphism in Quasipolynomial Time
📚
📚
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted