# In terms of P=?NP, would a P time solution to Subset-Sum have to work in P time when there is no subset that sums to T in the input?

This question is asking for clarification on what P=?NP is asking specifically. I've read the official problem description: here and it seems like P=?NP is primarily concerned with inputs that result in a 'yes' from the solver. For subset-sum, this would be inputs that do have a subset that sums to T.

My question is this: do inputs that result in a 'no' from the solver matter at all to the P=?NP problem? That is if you built an algorithm for subset-sum that runs in P time for every 'yes' input, would you have proved P==NP? OR, would you need to have an algorithm that runs in P time for EVERY input to subset-sum to have such a proof?

NOTE: I say you would have proved P==NP because subset-sum is NP-Complete and so all NP problems reduce to it in P time.

We say that $$M$$ runs in polynomial time if there exists $$k$$ such that for all $$n$$, $$T_M(n) \leq n^k + k.$$
which means that after $$T$$ runs for $$n^k + k$$ steps and hasn't accepted, it can reject because it would have already gone into the 'accept' state if the word were in the language. So 'no' answers are trivially dealt with by such an algorithm.