view wisdom/np-complete @ 12303:f31e76561a1f draft

<int-e> learn Time is an illusion. Lunchtime doubly so.
author HackEso <hackeso@esolangs.org>
date Sat, 25 Jan 2020 20:59:01 +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.