view wisdom/np-complete @ 12309:452180eb1c11 draft

<int-e> revert
author HackEso <hackeso@esolangs.org>
date Wed, 12 Feb 2020 01:19:55 +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.