News for hackers. Stuff that matters.
Re:Prism by degamad on Wednesday January 28, 2026 @12:24AM (#46791411)
> The P≠NP conjecture in CS says checking a solution is easier than finding one...

... for NP-hard problems.

It says nothing about the difficulty of finding or checking solutions of polynomial ("P") or exponential ("EXPTIME") problems.

There are no comments on this comment yet.