Bentley (2-dimensional Maximum subarray problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1811:18, 15 February 2023‎ Admin talk contribs‎ 374 bytes +374‎ 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.ezproxy.canberra.edu.au/doi/pdf/10.1145/1968.381154"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Bentley_(2-dimensional_Maximum_subarray_problem)"