Efficient computation in the news

Thore Husfeldt was interviewed on Saturday on Danish national radio about the newly claimed P!=NP proof. Sudoku was used as an example of an NP-hard problem. Of course, he could not resist squeezing in an explanation of how efficient computation (in P) is affecting all of our lives. Definitely this will do more good than my own appearance in the news!

1 Response to “Efficient computation in the news”


  1. 1 thore August 16, 2010 at 22:17

    Looks like you’re trying to explain the nontravelling salesman problem…

Leave a Reply

You must login to post a comment.