Imagen de Portada

The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Murthy, Sandeep
Formato:	Preprint
Publicado:	2007
Materias:	Data Structures and Algorithms Computational Complexity Group Theory F.2.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Structural Complexity of Matrix-Vector Multiplication
por: Anand, Emile, et al.
Publicado: (2025)

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

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

When Votes Change and Committees Should (Not)
por: Bredereck, Robert, et al.
Publicado: (2020)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
por: Andersson, Joel, et al.
Publicado: (2026)

Group Order Logic
por: Dahan, Anatole
Publicado: (2025)

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
por: Paszyński, Maciej
Publicado: (2024)

Towards universally optimal sorting algorithms
por: Sen, Sandeep
Publicado: (2025)

Eliminating Illusion in Directed Networks
por: Jana, Sougata, et al.
Publicado: (2026)

A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
por: Stapleton, Joshua
Publicado: (2025)

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

Parallel Algorithms for Group Isomorphism via Code Equivalence
por: Levet, Michael
Publicado: (2026)

On the Computation of 2-Dimensional Recurrence Equations
por: Natale, Giuseppe
Publicado: (2024)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
por: Salas, Jesus
Publicado: (2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
por: Saha, Barna, et al.
Publicado: (2024)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
por: Salas, Jesus
Publicado: (2025)

Selective algorithm processing of subset sum distributions
por: Dawes, Nick
Publicado: (2024)

An O(nlogn) approximate knapsack algorithm
por: Dawes, Nick
Publicado: (2025)

Complexity of Finding and Enumerating Interconnection Trees
por: Demange, Noé, et al.
Publicado: (2026)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
por: Chauhan, Archit, et al.
Publicado: (2025)

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

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
por: Krithika, R., et al.
Publicado: (2023)

Identity Testing for Circuits with Exponentiation Gates
por: Li, Jiatu, et al.
Publicado: (2025)

Spanning Trees Minimizing Branching Costs
por: Gargano, Luisa, et al.
Publicado: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
por: Gilfanov, Arthur
Publicado: (2024)

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
por: Sarriguren, Alfredo Goñi
Publicado: (2024)

Beating Meet-in-the-Middle for Subset Balancing Problems
por: Randolph, Tim, et al.
Publicado: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
por: Randolph, Tim, et al.
Publicado: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

More Asymmetry Yields Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2024)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
por: Khoruzhii, Kirill, et al.
Publicado: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
por: Kowaluk, Miroslaw, et al.
Publicado: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

On the Length of Strongly Monotone Descending Chains over $\mathbb{N}^d$
por: Schmitz, Sylvain, et al.
Publicado: (2023)

On the formalization of the notion of an algorithm
por: Middelburg, C. A.
Publicado: (2024)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
por: Li, Yifei
Publicado: (2024)

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

A Heuristic for Direct Product Graph Decomposition
por: Calderoni, Luca, et al.
Publicado: (2021)

An Efficient Algorithm for Unbalanced 1D Transportation
por: Gouvine, Gabriel
Publicado: (2023)

On the formalization of the notion of a concurrent algorithm
por: Middelburg, C. A.
Publicado: (2024)