Rick (LCS Longest Common Subsequence): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(sn + \min\{ | $O(sn + \min\{rm, sd\})$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:27, 28 April 2023
Time Complexity
$O(sn + \min\{rm, sd\})$
Space Complexity
$O(sn + p)$ words
(https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-60044-2_53)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1995
Reference
https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-60044-2_53