view wisdom/np-complete @ 12104:1730bda7af32 draft

<fizzie> sled /hackenv/bin/acronym//s|share/|$HACKENV/share/|
author HackEso <hackeso@esolangs.org>
date Sat, 16 Nov 2019 22:32:30 +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.