view wisdom/np-complete @ 12222:23a1a28b65cb draft

<shachaf> forget categorical product
author HackEso <hackeso@esolangs.org>
date Sun, 01 Dec 2019 19:43:34 +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.