Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173): Difference between revisions

@@ Property / cites work @@
+Q2913804
@@ Property / cites work: Q2913804 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778560
@@ Property / cites work: Q4778560 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight cell probe bounds for succinct Boolean matrix-vector multiplication
+Normal rank
@@ Property / cites work @@
+D rectangulations and geometric matrix multiplication
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Online Matrix-Vector Multiplication
@@ Property / cites work: Faster Online Matrix-Vector Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
+Normal rank
@@ Property / cites work @@
+Dynamic Steiner Tree Problem
@@ Property / cites work: Dynamic Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank
@@ Property / cites work @@
+Q2934692
@@ Property / cites work: Q2934692 / rank @@
+Normal rank