Shortest-path problem is not harder than matrix multiplication (Q1149782): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(80)90128-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2089633648
@@ Property / OpenAlex ID: W2089633648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures for matrix multiplication algorithms
+Normal rank
@@ Property / cites work @@
+Partial and Total Matrix Multiplication
@@ Property / cites work: Partial and Total Matrix Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1149782