Smith (2-dimensional Maximum subarray problem): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tags: Manual revert Reverted |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n^{3})$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(log n)$ auxiliary? words | |||
() | (divide-and-conquer) | ||
== Description == | == Description == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM | |||
== Year == | == Year == | ||
Revision as of 09:43, 28 April 2023
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