Saturday, March 22, 2008

NP-complete problem solved in constant time

(For computer science geeks only). This xkcd cartoon is about a revolutionary constant-time solution to the famous Travelling Salesperson problem.

0 Comments:

Post a Comment

Links to this post:

Create a Link

<< Internal Monologue home