Mathematical puzzles don't often get to star in feature films, but P vs NP is the subject of an upcoming thriller from Timothy Lanzone called "Travelling Salesman". The titles refers to the ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

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