For the solved problems ...

• some can be solved efficiently via a simple algorithm
• some have polynomial worst-case performance (e.g. O(V²))
• some have exponential worst-case performance (e.g. O(2^V))

• P = an algorithm can compute answer in polynomial time
• NP = no P algorithm is known for solving the problem