Hacker News new | ask | show | jobs
by Ramfjord 5788 days ago
P is a strict subset of NP. If you can solve the problem in polynomial time, then you can verify a solution simply by generating it.
1 comments

That means it's a subset and is trivial. To claim it's a strict subset means there's something in NP that's not in P.