view wisdom/np-complete @ 12305:fe459d857c0f draft

<int-e> forget kingoffrance
author HackEso <hackeso@esolangs.org>
date Mon, 27 Jan 2020 20:49:29 +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.