Re:The "C is Efficient" Language Fallacy (2006)
by attractivechaos on Monday January 09, 2012 @01:24PM
(#3443616)
Can you find the proof that finding all LCS is O(n^3)? The author was talking about "the standard algorithm for computing LCS". I was assuming the standard algorithm finds one LCS only.
[ Parent
| on HN ]
Re:The "C is Efficient" Language Fallacy (2006)
by cperciva on Monday January 09, 2012 @02:07PM
(#3443782)
Indeed, finding all LCSs requires exponential time: The strings "abcdefghijkl..." and "badcfehgjilk..." have the 2^(N/2) LCSs "[ab][cd][ef][gh][ij][kl]..." and no algorithm can ever run faster than the amount of time it takes to print its output.