Bit complexity of matrix products (Q808706): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A more efficient algorithm for the min-plus multiplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5605295 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3219752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient determination of the transitive closure of a directed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest-path problem is not harder than matrix multiplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast multiplication of large numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to multiply matrices faster / rank | |||
Normal rank |
Revision as of 08:36, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bit complexity of matrix products |
scientific article |
Statements
Bit complexity of matrix products (English)
0 references
1991
0 references
upper bound
0 references
bit complexity
0 references