I am learning computational complexity and parameter complexity. In order to proof that a problem is np-hard, we should reduction one which is np-hard to the problem. However, I don't have any idea about the various reductions of problem. How should I learn the reduction technique, is there a special teaching material or information? Greatful!
Asked
Active
Viewed 73 times
