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 ...

This is a preview. Log in through your library . Abstract In this paper, we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains ...

When computer scientists hang out at cocktail parties, they're apt to chat, among other things, about the single most important unsolved problem in computer science: the question, Does P = NP?