Number partition, if you present it to someone who isn't familiar with it, is probably the easiest sounding NP-complete problem. In practice, it's definitely on

Number partition, if you present it to someone who isn't familiar with it, is probably the easiest sounding NP-complete problem. In practice, it's definitely one of the easiest ones for practical applications. There' a paper entitled "The Easiest Hard Problem: Number Partitioning"(https://arxiv.org/pdf/cond-mat/0310317.pdf https://arxiv.org/pdf/cond-mat/0310317.pdf). But it reduces to subset sum, so it's not easy.