view wisdom/np-complete @ 11281:32b4d8cdda54

<oerjan> le/rn paraconsistent//There has been a lot of work on paraconsistent logics, although there hasn\'t been a lot of work on them.
author HackBot
date Sun, 24 Dec 2017 19:58:10 +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.