Average-case complexity of the min-sum matrix product problem (Q897863): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.09.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1505363495
@@ Property / OpenAlex ID: W1505363495 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
+Normal rank
@@ Property / cites work @@
+Faster all-pairs shortest paths via circuit complexity
+Normal rank
@@ Property / cites work @@
+An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ *  n)$
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths and the essential subgraph
+Normal rank
@@ Property / cites work @@
+Q3122914
@@ Property / cites work: Q3122914 / rank @@
+Normal rank
@@ Property / cites work @@
+An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Order Statistics
@@ Property / cites work: Order Statistics / rank @@
+Normal rank