Tamaki, Tokuyama (exact) (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
1998
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.5555/314613.314823