view wisdom/np-complete @ 11647:c9621db978d5 draft

<ais523> ` gcc -x c /dev/stdin <<< \'int main(void) {puts("Hello, world!"); return 0;}\'; ./a.out
author HackEso <hackeso@esolangs.org>
date Mon, 12 Nov 2018 00:39:13 +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.