P vs NP Problem

It means the problem cannot be solved by any algorithm It means no known polynomial-time algorithm exists, and finding one would prove P = NP, so large instances typically require heuristics or approximations It means the problem is solvable in O(n²) time It means the problem requires exactly exponential time