Yesterday, one of the classic computer science problems was discussed in the New York Times. They give a reasonable description of the P =? NP problem and why it is fundamental challenge in computer science. However, there are some errors that come from trying to explain the problem in general terms. Can you find them?
The source of this article is an article in the Communications of the ACM which gives a much more clear description of the problem. It's an article every computer science student should read! Let me know what you think!
No comments:
Post a Comment