Smith (2-dimensional Maximum subarray problem)
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/science/article/pii/0167642387900347