view wisdom/np-complete @ 12495:acd9425c0c6d draft

<shachaf> undo 11916
author HackEso <hackeso@esolangs.org>
date Mon, 04 Mar 2024 01:02:52 +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.