REVIEW 2 cited by
Consequences of the Moosbauer-Poole Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Moosbauer and Poole have recently shown that the multiplication of two $5\times 5$ matrices requires no more than 93 multiplications in the (possibly non-commutative) coefficient ring, and that the multiplication of two $6\times 6$ matrices requires no more than 153 multiplications. Taking these multiplication schemes as starting points, we found improved matrix multiplication schemes for various rectangular matrix formats using a flip graph search.
Forward citations
Cited by 2 Pith papers
-
Exploring Commutative Matrix Multiplication Schemes via Flip Graphs
A commutative flip graph defined on a quotient tensor space recovers known commutative matrix multiplication bounds up to 5x5 without improving any of them.
-
Higher order Jacobi method for solving system of linear equations
The higher order Jacobi method is a known repeated-squaring restatement of Jacobi iteration framed as a neural network, and the reported near-constant GPU scaling is not credible.
Discussion (0). Continue with ORCID to comment.