Mukhopadhyay (LCS Longest Common Subsequence)

From Algorithm Wiki
Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O((n + p) \log n)$ == Space Complexity == $O(p + n)$ words (https://www.sciencedirect.com/science/article/pii/0020025580900250) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/0020025580900250")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O((n + p) \log n)$

Space Complexity

$O(p + n)$ words

(https://www.sciencedirect.com/science/article/pii/0020025580900250)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1980

Reference

https://www.sciencedirect.com/science/article/pii/0020025580900250

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Mukhopadhyay_(LCS_Longest_Common_Subsequence)&oldid=44536"