Smith (2-dimensional Maximum subarray problem): Difference between revisions

Revision as of 08:56, 10 April 2023

$O(log^{2} n)$

words

()

Exact

No, deterministic

PRAM (not sure which type)

1987

@@ Line 1: / Line 1: @@
 == Time Complexity ==
-$O(n^{3})$
+$O(log^{2} n)$
 == Space Complexity ==
-$O(log n)$ auxiliary? words
+ words
-(divide-and-conquer)
+()
 == Description ==
@@ Line 23: / Line 23: @@
 == Model of Computation ==
-Word RAM
+PRAM (not sure which type)
 == Year ==