A problem whose computational complexity lies in the line between computational efficiency and computational intractability.
The set of np-complete problems are the primordial computational purgatory.
2👍 1👎