view wisdom/np-complete @ 9726:964fa629838b

<oerjan> slwd welcome.fr//s,http.*age,<http://esolangs.org/>,
author HackBot
date Fri, 18 Nov 2016 16:15:31 +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.