view wisdom/np-complete @ 12316:563db84bb4f8 draft

<wib_jonas> fetch /hackenv/interps/egel/readme-hackeso.txt https://hack.esolangs.org/get/interps/egel/readme-hackeso.txt
author HackEso <hackeso@esolangs.org>
date Fri, 21 Feb 2020 11:59: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.