The bit-operation complexity of matrix multiplication and of all pair shortest path problem
type: Item
instance of: scholarly article
title: The bit-operation complexity of matrix multiplication and of all pair shortest path problem
zbMATH Open document ID: 0462.68019
DOI: 10.1016/0898-1221(81)90130-9
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3723854
author: Victor Y. Pan
MaRDI profile type: Publication
full work available at URL: 0898-1221(81)90130-9
OpenAlex ID: W2139007071
cites work: Gaussian elimination is not optimal
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: New Fast Algorithms for Matrix Operations
cites work: New combinations of methods for the acceleration of matrix multiplication
cites work: Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
cites work: Q4134968
cites work: The bit-complexity of arithmetic algorithms
cites work: Q4190138
cites work: An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
cites work: New Bounds on the Complexity of the Shortest Path Problem
cites work: Complexity measures for matrix multiplication algorithms
cites work: Q5676984
cites work: The Computational Complexity of Continued Fractions
cites work: Fast multiplication of large numbers
cites work: Q4091421
cites work: Shortest-path problem is not harder than matrix multiplication
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3723854