view wisdom/np-complete @ 11990:7c770f5b66d2 draft

<ais523> delquote 1271
author HackEso <hackeso@esolangs.org>
date Thu, 24 Oct 2019 22:13:54 +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.