view wisdom/np-complete @ 12310:09fcf6be0ef8 draft

<shachaf> undo 12307
author HackEso <hackeso@esolangs.org>
date Wed, 12 Feb 2020 01:20:32 +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.