Rick (LCS Longest Common Subsequence): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== 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") |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(sn + \min\{ | $O(sn + \min\{rm, sd\})$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O(sn + p)$ words | $O(sn + p)$ words | ||
(https://link.springer.com/chapter/10.1007 | (https://link.springer.com/chapter/10.1007/3-540-60044-2_53) | ||
== Description == | == Description == | ||
| Line 31: | Line 31: | ||
== Reference == | == Reference == | ||
https://link.springer.com/chapter/10.1007 | https://link.springer.com/chapter/10.1007/3-540-60044-2_53 | ||
Latest revision as of 10:27, 28 April 2023
Time Complexity
$O(sn + \min\{rm, sd\})$
Space Complexity
$O(sn + p)$ words
(https://link.springer.com/chapter/10.1007/3-540-60044-2_53)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1995