view wisdom/np-complete @ 12231:44379732c06b draft

<b_jonas> fetch /hackenv/bin/whatis https://hack.esolangs.org/get/bin/whatis
author HackEso <hackeso@esolangs.org>
date Thu, 05 Dec 2019 20:05:28 +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.