Confusion About NP-Hard and NP-Complete in Traveling Salesman Problems by Matt

What does TSP stand for in the context of algorithms?
In the context of algorithms, TSP stands for Travelling Salesman Problem.

What does NP stand for in the context of computational complexity?
In the context of computational complexity, NP stands for Nondeterministic Polynomial time.

When is a problem in NP?
A problem is in NP if it is easy to verify its solutions.

When is a problem NP-hard?
A problem is NP-hard if it is difficult to solve or find a solution.

When is a problem NP-complete?
A problem is NP-complete if it is both in NP and NP-hard.

What is a decision problem?
A decision problem is a problem whose answer is yes or no.

Formally, what type of problem do the NP-hard and NP-complete definitions apply to?
Formally, the type of problem the NP-hard and NP-complete definitions apply to are decision problems.

When is the Travelling Salesman Problem (TSP) NP-hard? (1)
The TSP is NP-hard if it refers to a search or optimization problem.

When is the Travelling Salesman Problem (TSP) NP-complete? (1)
The TSP is NP-complete if it refers to a decision problem.