Bentley (2-dimensional Maximum subarray problem)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ auxiliary? words ((i think you need to pre-process to get cumulative sums in each row?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://dl.acm.org/doi/pdf/10.1145/1968.381154")
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$ auxiliary? words
((i think you need to pre-process to get cumulative sums in each row?))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984