view wisdom/np-complete @ 12262:6908a7095bcd draft

<int-e> sled ../bin/"//s=-r=--r=
author HackEso <hackeso@esolangs.org>
date Sun, 08 Dec 2019 00:00:47 +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.