Smith (2-dimensional Maximum subarray problem): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tag: Reverted
No edit summary
Tag: Manual revert
 
(3 intermediate revisions by the same user not shown)
(No difference)

Latest revision as of 09:43, 28 April 2023

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