Imagen de Portada

Finite matrix multiplication algorithms from infinite groups

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Blasiak, Jonah, Cohn, Henry, Grochow, Joshua A., Pratt, Kevin, Umans, Chris
Formato:	Preprint
Publicado:	2024
Materias:	Group Theory Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Constant-Depth Circuit Complexity of Generating Quasigroups
por: Collins, Nathaniel A., et al.
Publicado: (2024)

A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
por: Umans, Chris, et al.
Publicado: (2025)

Showcasing straight-line programs with memory via matrix Bruhat decomposition
por: Niemeyer, Alice C., et al.
Publicado: (2013)

Testability in group theory
por: Becker, Oren, et al.
Publicado: (2022)

Breaking the cubic barrier in the Solovay-Kitaev algorithm
por: Kuperberg, Greg
Publicado: (2023)

Streaming algorithms for groups and semigroups
por: Lohrey, Markus, et al.
Publicado: (2022)

Testability of relations between permutations
por: Becker, Oren, et al.
Publicado: (2020)

The $Z$-Curve as an $n$-Dimensional Hypersphere: Properties and Analysis
por: Gonzalez, Diego Vazquez, et al.
Publicado: (2024)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
por: Levet, Michael, et al.
Publicado: (2025)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
por: Johnson, Dan, et al.
Publicado: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
por: Tate, Elise, et al.
Publicado: (2025)

The Generalized Skew Spectrum of Graphs
por: Bellante, Armando, et al.
Publicado: (2025)

A Faster Isomorphism Test for Graphs of Small Degree
por: Grohe, Martin, et al.
Publicado: (2018)

A note on Ordered Ruzsa-Szemerédi graphs
por: Pratt, Kevin
Publicado: (2025)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
por: Harris, David G.
Publicado: (2021)

Explicit Lossless Vertex Expanders
por: Hsieh, Jun-Ting, et al.
Publicado: (2025)

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
por: Murthy, Sandeep
Publicado: (2007)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
por: Chen, Shujing, et al.
Publicado: (2025)

Systematic Approach to Hyperbolic Quantum Error Correction Codes
por: Mahmoud, Ahmed Adel, et al.
Publicado: (2025)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
por: Björklund, Andreas, et al.
Publicado: (2024)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
por: Fischer, David, et al.
Publicado: (2022)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
por: Peikert, Chris, et al.
Publicado: (2025)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
por: Grochow, Joshua A., et al.
Publicado: (2025)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
por: Fan, Zhou, et al.
Publicado: (2026)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
por: Smart, Bridget, et al.
Publicado: (2025)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Randomized and quantum approximate matrix multiplication
por: Apers, Simon, et al.
Publicado: (2025)

Computing congruences of finite inverse semigroups
por: Elliott, Luna, et al.
Publicado: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
por: Chen, Tyler
Publicado: (2024)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
por: Taylor, Landon, et al.
Publicado: (2025)

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
por: Pfrommer, Jakob, et al.
Publicado: (2022)

Faster Convolutions: Yates and Strassen Revisited
por: Brand, Cornelius, et al.
Publicado: (2025)

A symmetric recursive algorithm for mean-payoff games
por: Ohlmann, Pierre
Publicado: (2026)

Indexing Finite-State Automata Using Forward-Stable Partitions
por: Becker, Ruben, et al.
Publicado: (2024)

Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
por: Rai, Shanthanu S
Publicado: (2024)

The clustered Sparrow algorithm
por: Dumitrescu, Cristian
Publicado: (2018)

Canonical forms for matrix tuples in polynomial time
por: Qiao, Youming, et al.
Publicado: (2024)

A proximal gradient algorithm for composite log-concave sampling
por: Liu, Linghai, et al.
Publicado: (2026)

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation
por: Compton, Spencer, et al.
Publicado: (2025)