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

@@ 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