Speaking as a former algorithms-and-complexity TA --
Proving something is in NP is usually trivial, but probably would be worth a point or two. The people taking complexity at a top-tier school have generally mastered the art of partial credit and know to write down anything plausibly relevant that occurs to them.
I think roystgnr’s comment was meant to be parsed as:
“Hmm… I can prove that this is in NP, and I can prove it is not in P and is not in NP-Complete. But that’s not worth any points at all!” (crumples up and throws away paper)
Corollary:
...they shouldn’t have crumpled that piece of paper.
Speaking as a former algorithms-and-complexity TA --
Proving something is in NP is usually trivial, but probably would be worth a point or two. The people taking complexity at a top-tier school have generally mastered the art of partial credit and know to write down anything plausibly relevant that occurs to them.
I think roystgnr’s comment was meant to be parsed as:
Corollary:
...they shouldn’t have crumpled that piece of paper.
That was my intention; thanks for fixing the phrasing.