An Italian researcher with a penchant for retro games -- or perhaps just looking for an excuse to play games in the name of science! -- has used computational complexity theory to decide, once and for ...

Imagine a parallel universe where physicists are remunerated so handsomely that they can accumulate multitudinous assets. In this alternate universe, you naturally wish to share your good fortune, so ...

They have a mathematical, analog “solver” that can potentially find the best solution to NP-hard problems. NP-hardness is a theory of computational complexity, with problems that are famous for their ...

Developer King's match-three puzzler Candy Crush Saga is officially a difficult game, according to a new mathematical analysis of the title that places the game into a category of high-level ...