Takaoka (2-dimensional Maximum subarray problem)
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