view wisdom/np-complete @ 12241:033de8f65e9c draft

<b_jonas> addwhatis bfi(1hackeso) - no description
author HackEso <hackeso@esolangs.org>
date Thu, 05 Dec 2019 22:46:52 +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.