Smith (2-dimensional Maximum subarray problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(log n)$ auxiliary? words (divide-and-conquer) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://www.sciencedirect.com/science/article/pii/0167642387900347") |
No edit summary Tag: Manual revert |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(log^{2} n)$ | ||
== Space Complexity == | == Space Complexity == | ||
words | |||
( | () | ||
== Description == | == Description == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
PRAM (not sure which type) | |||
== Year == | == Year == | ||
Latest revision as of 09:43, 28 April 2023
Time Complexity
$O(log^{2} n)$
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
PRAM (not sure which type)
Year
1987
Reference
https://www.sciencedirect.com/science/article/pii/0167642387900347