Rick (LCS Longest Common Subsequence): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Reverted |
No edit summary Tag: Manual revert |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(sn + \min\{rm | $O(sn + \min\{r(n - r )$, rm\}) | ||
== Space Complexity == | == Space Complexity == | ||
Revision as of 11:14, 15 February 2023
Time Complexity
$O(sn + \min\{r(n - r )$, rm\})
Space Complexity
$O(sn + p)$ words
(https://link.springer.com/chapter/10.1007%2F3-540-60044-2_53)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1995
Reference
https://link.springer.com/chapter/10.1007%2F3-540-60044-2_53