view wisdom/np-complete @ 12166:2b6654c1b493 draft

<oerjan> undo 12162
author HackEso <hackeso@esolangs.org>
date Wed, 20 Nov 2019 04:13:12 +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.