NP problem
Summary Problem Type Verifiable in P time Solvable in P time P Yes Yes NP Yes Yes or No * NP-Complete Yes Unknown NP-Hard Yes or No** Unknown *** Increasing Difficulty * An NP problem that is also P is solvable in P time. ** An NP-Hard problem that is also NP-Complete is verifiable in P time. *** NP-Complete problems (all of which form a subset of NP-hard) might be. The rest of NP hard is not....