Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • 2
    $\begingroup$ I don't think you understand what "no certificate" is. It is not determining if a putative solution is invalid. It requires showing that a problem instance has no possible solution. $\endgroup$ Commented Nov 26, 2015 at 0:22
  • $\begingroup$ I understand it quite well, but maybe I don't understand the question. The complement (co-NP) for the subset sum problem asks whether or not, "for a given set of integers, every subset of integers must have a non-zero sum" which, as a problem, is not seen to be in the set of NP. This seems obvious. However, a 'no' answer to that complement could easily be verified in polynomial time. $\endgroup$ Commented Nov 26, 2015 at 1:15