3 ms·
Seeing O(N^3) as runtime complexity for computing LCS was enough of a red flag for me to completely ignore anything that came after the incorrect claim. (For mo
by aanastasov 10y ago
Seeing O(N^3) as runtime complexity for computing LCS was enough of a red flag for me to completely ignore anything that came after the incorrect claim. (For more info, see https://en.wikipedia.org/wiki/Longest_common_subsequence_problem https://en.wikipedia.org/wiki/Longest_common_subsequence_pro...)