The latest News Headlines from the Scientific, Research and HighTech world

Články z Technology Review Feed - Tech Review Top StoriesBlog - Pac-Man Proved NP-Hard By Computational Complexity Theory

26. 1 2012 (11:33)

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