view wisdom/np-complete @ 12301:40cbf2cbf821 draft

<fizzie> le/rn bug//Feel free to file bugs at https://github.com/fis/hackbot/issues
author HackEso <hackeso@esolangs.org>
date Tue, 07 Jan 2020 17:15:32 +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.