view wisdom/np-complete @ 12180:4a67615f9456 draft

<fizzie> delquote 251
author HackEso <hackeso@esolangs.org>
date Fri, 22 Nov 2019 01:47:33 +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.