Talk:Set cover problem

From Wikipedia, the free encyclopedia

You have new messages (last change).

What does it mean to call the decision problem NP-complete and the optimization problem NP-hard? NP-hardness refers to decision problems. Isn't #P-completeness the notion we are after for the optimization part?

Retrieved from "http://en.wikipedia.org../../../s/e/t/Talk%7ESet_cover_problem_cac5.html"