view wisdom/np-complete @ 11185:d2b49d3cf33a

<mroman> slashlearn turing test//A turing test tests by what amount you can tur.
author HackBot
date Sat, 02 Sep 2017 19:23:54 +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.