KALYAN PERUMALLA and NARSINGH DEO (2-dimensional Maximum subarray problem)
Jump to navigation
Jump to search
Time Complexity
$O(log n)$
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
CREW PRAM
Year
1995
Reference
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.1291&rep=rep1&type=pdf