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.

Comments

Popular posts from this blog

Where is 56th and Wabasha? "Meet Me in the Morning" Dylan Mystery Solved

Snarking The Odyssey (with AD&D)

Random harlot generation table in AD&D Dungeon Master's Guide