Annoying, I took theoretical computer science in university and used to have a better grasp on this, but apparently that part of complexity theory atrophied by now.
As useful rule of thumb, the way I learned to think about NP was the mnemonic "nifty proof." Problems in NP are not known to have a polynomial-time solution, and are not known to have no polynomial time solution; that's the million dollar question. What they are known to have is a polynomial time validation.
So it might take some heinous amount of time to find the pre-image of the hash, but determining if a given input string is the pre-image of the hash is polynomial on the number of characters in the pre-image (just run the hash function).
NP is the class of problems that can be solved in polynomial time by a non-deterministic automaton.
1)A 5 gallon bucket of gasoline
2) a shop vac w/o a filter & the hose stuck in the bucket to disperse it into the air as a fine mist
3) a bottle rocket sent through the front door (from across the street, preferably)
You know, I've never really though about how to make a homemade fuel air bomb before. It's a bit disturbing that it probably wouldn't be much harder than the above.