Smith (2-dimensional Maximum subarray problem)

From Algorithm Wiki

Revision as of 09:56, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/science/article/pii/0167642387900347

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Smith_(2-dimensional_Maximum_subarray_problem)&oldid=47573"