P, NP, NP-hard
P, NP, NP-hard. P, NP, NP-hard diagram. NP. NP-hard. P. NP-complete. P, NP problems definitions. P = {L І з p(n), M (deterministic) solves L in p(n) time} NP = {L І з p(n), M (non-deterministic) solves L in p(n) time}. NP-hard, NP-complete problems definitions.
510 views • 5 slides