view wisdom/np-complete @ 12297:3982d33f7f21 draft

<fizzie> ` rm /hackenv/interps/bfi
author HackEso <hackeso@esolangs.org>
date Sat, 04 Jan 2020 13:39:37 +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.