view wisdom/np-complete @ 11966:3f1a4ab429fd draft

<b_jonas> `` sed -i \'1s"$" https://github.com/KrzysztofSzewczyk/esologs/"\' wisdom/log
author HackEso <hackeso@esolangs.org>
date Sat, 12 Oct 2019 10: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.