view wisdom/np-complete @ 12330:039641307831 draft

<shachaf> slbd pbflist//$d
author HackEso <hackeso@esolangs.org>
date Thu, 07 May 2020 01:40:18 +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.