Any guidance on how to recognize that a give problem won't have polynomial time algo? One can't make an exhaustive list and remember them all during the interview let alone reducing some problem to them.