Hacker News new | past | comments | ask | show | jobs | submit login

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_pro...)



Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: