Answer: A
P is a subset of NP. P problems are decidable
in polynomial time, and NP problems are verifiable in polynomial time. A
problem that is decidable in polynomial time is also verifiable in polynomial
time.
NP is not a subset of NP-hard. NP-hard problems
are at least as hard as any NP problem, meaning that there is no efficient
algorithm that can solve them in polynomial time.
NP-complete problems are a subset of NP-hard problems
and are the hardest problems in NP. NP-complete problems can be verified
in polynomial time.
0 comments:
Post a Comment