22 June 2011
P = NP?
From Derek Bolton
Your article "The hardest problem" (4 June, p 36) made it sound as though proving P=NP would immediately allow us to solve many problems that have stumped computer science, whether timetabling, travelling salesman routes or sudokus. But actually it would only tell us that an algorithm to solve the problem quickly exists in each case. …
