Bentley (2-dimensional Maximum subarray problem)

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?))

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1984

Reference

https://dl.acm.org/doi/pdf/10.1145/1968.381154