view wisdom/np-complete @ 12271:6389adbc4a0d draft

<kspalaiologos> fetch /hackenv/asmbf-1.2.6.zip https://github.com/KrzysztofSzewczyk/asmbf/archive/master.zip
author HackEso <hackeso@esolangs.org>
date Tue, 31 Dec 2019 15:59:04 +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.