view wisdom/np-complete @ 8983:aa3200667614

<oerjan> learn NP-complete is the subset of NP to which all problems in P can be reduced, thus completely solving them.
author HackBot
date Sat, 27 Aug 2016 17:11:01 +0000
parents
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.