2017
DOI: 10.48550/arxiv.1707.06860
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications

Abstract: We present a non-commutative algorithm for multiplying 5 × 5 matrices using 99 multiplications. This algorithm is a minor modification of Makarov's algorithm which exhibit the previous best known bound with 100 multiplications.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 12 publications
(17 reference statements)
0
1
0
Order By: Relevance
“…Pursuing the works done the last 53 years in [18][19][20]22], we propose a new non-commutative algorithm for multiplying 5 × 5 matrices using 98 multiplications. More precisely, by presenting explicit algorithms, we establish the following result: Theorem 1.1.…”
Section: Introductionmentioning
confidence: 99%
“…Pursuing the works done the last 53 years in [18][19][20]22], we propose a new non-commutative algorithm for multiplying 5 × 5 matrices using 98 multiplications. More precisely, by presenting explicit algorithms, we establish the following result: Theorem 1.1.…”
Section: Introductionmentioning
confidence: 99%