NP-Completeness: Intractability complexity classes and proving problems are NP-complete