view wisdom/np-complete @ 12239:7c23c10f2ff4 draft

<b_jonas> addwhatis asmbfx(1hackeso) - no description
author HackEso <hackeso@esolangs.org>
date Thu, 05 Dec 2019 22:46:15 +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.