AMA | September 2024

9780.533 - 9802.469 Sean Carroll

all the details are kind of fuzzy and don't matter. But roughly speaking, these are easier than exponentially hard problems, problems that it takes, you know, e to the number of inputs to solve in some algorithm that you could write down. NP problems are problems where you can check the solution very easily, but you are not guaranteed to be able to find the solution very easily.