view wisdom/np-complete @ 12294:abacb968c310 draft

<kspalaiologos> `` rm -f /hackenv/bin/bfi
author HackEso <hackeso@esolangs.org>
date Sat, 04 Jan 2020 09:50:24 +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.