Karp reduction is a polynomial-time many-one reduction used in computational complexity theory to show that one problem is at least as hard as another by transforming instances of one problem into instances of another. It is a fundamental tool for proving NP-completeness, as it demonstrates that if one NP-complete problem can be solved in polynomial time, then all problems in NP can be solved in polynomial time.