GeekPress
Technology news, shaken not stirred...
Thursday, January 26, 2012
Pac-Man Proved NP-Hard By Computational Complexity Theory
"Pac-Man
Proved NP-Hard
By Computational Complexity Theory"
‹
›
Home
View web version