Wen (2-dimensional Maximum subarray problem)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1995 == Reference == https://www.sciencedirect.com/science/article/abs/pii/016781919400063G")

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

Jump to navigation Jump to search

Time Complexity

$O(log n)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

EREW PRAM

Year

1995

Reference

https://www.sciencedirect.com/science/article/abs/pii/016781919400063G

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Wen_(2-dimensional_Maximum_subarray_problem)&oldid=45695"