Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
A Tale of A Serious Attempt At P≠NP by Richard J. Lipton (acm.org)
8 points by amichail on Aug 16, 2010 | hide | past | favorite | 1 comment



An interesting read that attempts to convey the reason the P vs NP problem is important to those that do not have knowledge of complexity theory.

As a side note, one part that Lipton does not make completely clear, although with further reading should be obvious, is that his example umbrella statement Q is equivalent to the statement that P != NP.




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

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

Search: