Kuo and Cross (LCS Longest Common Subsequence): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:4210:42, 15 February 2023‎ Admin talk contribs‎ 386 bytes +386‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Kuo_and_Cross_(LCS_Longest_Common_Subsequence)"