view wisdom/np-complete @ 11977:dd90453f9308 draft

<kspalaiologos> `` cp tmp/asmbf-1.1.1/bin/bconv /hackenv/bin
author HackEso <hackeso@esolangs.org>
date Wed, 23 Oct 2019 17:44:21 +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.