>> NP-complete is essentially shorthand for belonging to a class of problems that are computationally very hard

That is actually incorrect, and is a common and serious misunderstanding of beginners. NP-complete problems are not hard to solve (e.g. via brute force). They are however very hard to solve efficiently (i.e. in polynomial time).