Strong NP-Completeness
A decision problem is strong NP-complete if it remains NP-complete even if the numerical inputs are presented in unary.
Subset Sum and similar problems are polynomial time solvable if the problem is presented in unary.
3-Partition and Bin Packing are strong NP-complete.