Which might be the saving grace should the equality turn out to be true, given the sheer number of scary-powerful algorithms that happen to be NP-complete. Cert

Which might be the saving grace should the equality turn out to be true, given the sheer number of scary-powerful algorithms that happen to be NP-complete. Certainly it'd be convenient if they were solvable, but... probably not safe, you understand? Not really relevant here, though.