Kuo and Cross (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(p + n(r+\log n)$)
Space Complexity
$O(p + n)$ words
(https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/74697.74702, Same space complexity as Hunt and Szymanski.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1989
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=74702