Kuo and Cross (LCS Longest Common Subsequence)
Revision as of 11:42, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(p + n(r+\log n)$) == Space Complexity == $O(p + n)$ words (https://dl.acm.org/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/citation.cfm?id=74702")
Time Complexity
$O(p + n(r+\log n)$)
Space Complexity
$O(p + n)$ words
(https://dl.acm.org/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