view wisdom/np-complete @ 12314:e7e9a95f76de draft

<oerjan> undo 12128
author HackEso <hackeso@esolangs.org>
date Fri, 21 Feb 2020 03:24:20 +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.