Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Np-Hardness - How do you show NP hardness?


To show that a problem A is NP-hard, you need to reduce a known NP-hard problem to A. In simpler terms, to prove that your problem is difficult, you need to outline an efficient algorithm to solve a different problem, which is already known to be hard, using an efficient algorithm for your problem as a black-box subroutine.