Chin and Poon (LCS Longest Common Subsequence): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(sn + \min\{sp, rm\})$ == Space Complexity == $O(p + n)$ words (https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-58338-6_63.pdf, Fig. 3) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1991 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=105592") |
No edit summary |
||
| Line 31: | Line 31: | ||
== Reference == | == Reference == | ||
https://dl-acm-org.ezproxy.canberra.edu.au/ | https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.5555/105582.105592 | ||
Latest revision as of 09:28, 28 April 2023
Time Complexity
$O(sn + \min\{sp, rm\})$
Space Complexity
$O(p + n)$ words
(https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-58338-6_63.pdf, Fig. 3)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1991
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.5555/105582.105592