In my experience of NP-complete research, there tends to be “real world bias”. There are problems we can mostly solve in polynomial time, and those gets lots o

In my experience of NP-complete research, there tends to be “real world bias”. There are problems we can mostly solve in polynomial time, and those gets lots of study and people talk about them a lot. There are other problems which are equally valid np-complete problems, for example reversing most encryption and hashing algorithms (with hashes you obviously don’t get a unique reversal, but you can get something), which we generally don’t discuss, as they are entirely unsolvable in practice.