view wisdom/np-complete @ 11960:97c98bfc08d5 draft

<int-e> forget brilliant
author HackEso <hackeso@esolangs.org>
date Tue, 08 Oct 2019 14:25:39 +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.