4 ms·
I think it claims the opposite, that P != NP: > Since there is at least one algorithm (WESP) that is NP (verifiable in polynomial time) but not P (solvable in
by kkoncevicius 3y ago
I think it claims the opposite, that P != NP:
> Since there is at least one algorithm (WESP) that is NP (verifiable in polynomial time) but not P (solvable in polynomial time), P cannot be the same set as NP.
- man_of_wax 3y agoMade a typo in the title. I've fixed it thanks.