A note on 'Is shortest path problem not harder than matrix multiplication?'
type: Item
instance of: scholarly article
title: A note on 'Is shortest path problem not harder than matrix multiplication?'
zbMATH Open document ID: 0474.68078
DOI: 10.1016/0020-0190(81)90039-9
author: Shlomo Moran
published in: Information Processing Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 3744565
zbMATH Keywords: bitwise complexity
zbMATH Keywords: total arithmetic complexity
zbMATH Keywords: reducibility
MaRDI profile type: Publication
full work available at URL: 0020-0190(81)90039-9
OpenAlex ID: W1997654840
cites work: Q4091421
cites work: Shortest-path problem is not harder than matrix multiplication
cites work: A lower bound on the number of additions in monotone computations
cites work: Gaussian elimination is not optimal
cites work: An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
description: scientific article; zbMATH DE number 3744565