view wisdom/np-complete @ 12126:da23f60cf8d3 draft

<fizzie> ` for d in + -; do sed -i -e \'s|tee karma|tee ${HACKENV-/hackenv}/karma|\' /hackenv/bin/karma$d; done
author HackEso <hackeso@esolangs.org>
date Sun, 17 Nov 2019 00:56:12 +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.