view wisdom/np-complete @ 12354:2408213705e7 draft

<int-e> slwd aoc//s/2019/2020/
author HackEso <hackeso@esolangs.org>
date Tue, 01 Dec 2020 06:21:11 +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.