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 62 times
0
-
usually it boils down to understanding the definitions of the problems well enough and choosing the appropriate NP-hard problem to reduce from – nir shahar Nov 27 '21 at 15:09
-
https://cs.stackexchange.com/q/1240/755, https://cs.stackexchange.com/q/11209/755 – D.W. Nov 27 '21 at 22:51
-
Thank you! It is so hard. – zhukui bai Nov 28 '21 at 05:31