view wisdom/np-complete @ 12160:2c8c313864e7 draft

<fizzie> slbd wiki//6,7d;s/quote(f)/quote(sys.argv[1])/
author HackEso <hackeso@esolangs.org>
date Tue, 19 Nov 2019 01:22:24 +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.