Image de couverture de livre

An Exact 56-Addition, Rank-23 Scheme for General 3*3 Matrix Multiplication

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Sun, Yinqi
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
par: Perminov, A. I.
Publié: (2025)

More Asymmetry Yields Faster Matrix Multiplication
par: Alman, Josh, et autres
Publié: (2024)

Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
par: Wang, Chengu
Publié: (2026)

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
par: Uhlmann, Jeffrey
Publié: (2025)

A Refined Laser Method and Faster Matrix Multiplication
par: Alman, Josh, et autres
Publié: (2020)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Asymptotic Rank Speedup Theorems, Revisited
par: Alman, Josh, et autres
Publié: (2026)

Near-Optimal Averaging Samplers and Matrix Samplers
par: Xun, Zhiyang, et autres
Publié: (2024)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)

Near-Optimality for Single-Source Personalized PageRank
par: Jiang, Xinpeng, et autres
Publié: (2025)

Quantum Worst-Case to Average-Case Reduction for Matrix-Vector Multiplication
par: Aggarwal, Divesh, et autres
Publié: (2025)

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
par: Jansen, Klaus, et autres
Publié: (2025)

Geometric Interpretation of 3-SAT and Phase Transition
par: Gillet, Frederic
Publié: (2025)

Hardness and Algorithmic Results for Roman \{3\}-Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

Segmented Operations using Matrix Multiplications
par: Sobczyk, Aleksandros, et autres
Publié: (2025)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
par: Michel, Lukas, et autres
Publié: (2023)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
par: Khanna, Sanjeev, et autres
Publié: (2026)

Bipartite Exact Matching in P
par: Du, Yuefeng
Publié: (2026)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2020)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

The Query Complexity of Local Search in Rounds on General Graphs
par: Brânzei, Simina, et autres
Publié: (2026)

Subset Balancing and Generalized Subset Sum via Lattices
par: Gao, Yiming, et autres
Publié: (2026)

Exact and Approximate Algorithms for Polytree Learning
par: Harviainen, Juha, et autres
Publié: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions
par: Cheng, Kuan, et autres
Publié: (2025)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
par: Grüttemeier, Niels, et autres
Publié: (2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
par: Fekete, Sándor P., et autres
Publié: (2025)

Omnipredictors for Regression and the Approximate Rank of Convex Functions
par: Gopalan, Parikshit, et autres
Publié: (2024)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
par: Kurpisz, Adam, et autres
Publié: (2026)

Exact Algorithms for Edge Deletion to Cactus
par: Akhtar, Sheikh Shakil, et autres
Publié: (2026)

Neighborhood-Aware Graph Labeling Problem
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

Lazy Kronecker Product
par: Song, Zhao
Publié: (2026)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
par: Ducoffe, Guillaume
Publié: (2026)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
par: Asadi, Vahid R., et autres
Publié: (2026)

NP-Hardness and a PTAS for the Pinwheel Problem
par: Kleinberg, Robert, et autres
Publié: (2026)