Fast Generalized DFTs for All Finite Groups

IF 1.2 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS SIAM Journal on Computing Pub Date : 2024-09-04 DOI:10.1137/20m1316342

Chris Umans

引用次数: 0

Abstract

SIAM Journal on Computing, Ahead of Print.
Abstract. For any finite group [math], we give an algebraic algorithm to compute the generalized discrete Fourier transform with respect to [math], using [math] operations, for any [math]. Here, [math] is the exponent of matrix multiplication.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

适用于所有有限群的快速广义 DFT

SIAM 计算期刊》，提前印刷。摘要。对于任意有限群 [math]，我们给出了一种代数算法，对于任意 [math]，使用 [math] 运算计算关于 [math] 的广义离散傅里叶变换。这里，[math] 是矩阵乘法的指数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

SIAM Journal on Computing 工程技术-计算机：理论方法

CiteScore

4.60

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The SIAM Journal on Computing aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution. Topics include but are not limited to analysis and design of algorithms, algorithmic game theory, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational biology, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.

期刊最新文献

Optimal Resizable Arrays Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics Resolving Matrix Spencer Conjecture up to Poly-Logarithmic Rank Complexity Classification Transfer for CSPs via Algebraic Products Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence