Every NP problem 만큼 어렵다모두 환원가능해야 하므로 NP-hardnessIn computational complexity theory, NP-hardness is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". A simple example of an NP-hard problem is the subset sum problem.https://en.wikipedia.org/wiki/NP-hardness
Seonglae ChoSeonglae ChoSeonglae ChoSeonglae ChoSeonglae ChoSeonglae Cho
