« Contre le mal-logement, taxer le sous-peuplement ? | Accueil | La santé par l'orgasme »
27 janvier 2012
Pac-Man Proved NP-Hard By Computational Complexity Theory
The classic '80s arcade game turns out to be equivalent to the travelling salesman problem, according a new analysis of the computational complexity of video games
via Pac-Man Proved NP-Hard By Computational Complexity Theory - Technology Review
via Pac-Man Proved NP-Hard By Computational Complexity Theory - Technology Review
Aucun Trackback
URL de Trackback : http://www.31065.org/mt/mt-tb.cgi/3030
Laisser un commentaire