Takaoka (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(n^{3} * ((log log n)$/(log n))^({1}/{2})) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2002 == Reference == https://www.sciencedirect.com/science/article/pii/S1571066104003135?via%3Dihub")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3} * ((log log n)$/(log n))^({1}/{2}))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2002

Reference

https://www.sciencedirect.com/science/article/pii/S1571066104003135?via%3Dihub

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