The Travelling Salesman Problem (TSP) is a classic problem in combinatorial optimization. It is known to be NP-hard, meaning that no polynomial-time algorithm is known to solve it efficiently, and it is at least as hard as the hardest problems in NP.
Thus, the correct answer is \( \text{NP-hard} \).