# Prove Subset-Sum is NP-complete - Alternative reduction?

It is well known the Subset-Sum problem is NP-complete. This can be shown using a reduction from the 3SAT problem. I am wondering: is there any other NP-Complete problem that could be reduced to the Subset-Sum problem?

In general, each $$NP$$-hard problem can be reduced to all other known $$NP$$-hard problems (there exist hundreds).