view wisdom/np-complete @ 12335:040020ba3072 draft

<int-e> learn The password of the month is peeping Tom.
author HackEso <hackeso@esolangs.org>
date Mon, 01 Jun 2020 00:25:46 +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.