view wisdom/np-complete @ 12350:2678f7ed17a8 draft

<wib_jonas> revert
author HackEso <hackeso@esolangs.org>
date Wed, 04 Nov 2020 14:35:59 +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.