view wisdom/np-complete @ 12323:218170b15400 draft

<int-e> learn The password of the month is starving for attention.
author HackEso <hackeso@esolangs.org>
date Sun, 05 Apr 2020 05:35:54 +0000
parents aa3200667614
children
line wrap: on
line source

NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.