view wisdom/np-complete @ 11730:7c8a5068a82d draft

<wob_jonas> forget biweekly/the
author HackEso <hackeso@esolangs.org>
date Thu, 14 Feb 2019 15:09:08 +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.