> Able to recognize and code dynamic programming solutions, good knowledge of graph algorithms, good knowledge of numerical computation algorithms, able to identify NP problems etc.
I'm pretty sure the author means "NP-hard" problems. And putting dynamic programming at the top of the algorithms tier is a pretty low bar. My guess is the author of this table isn't so strong on algorithms and hasn't explored what's beyond an introductory algorithms class.
Edit: the reason I say "pretty sure" is because there are a lot of people who work on practical problems that are not in NP because the problem does not have well defined solutions. But in the context of the rest of the table, the author likely did not intend to make this fine distinction.
Yeah, P != NP hasn't been proven, so identifying problems in NP that are not in P might be impossible! Maybe identifying exponential or higher-order functions would be more tractable :)
I'm pretty sure the author means "NP-hard" problems. And putting dynamic programming at the top of the algorithms tier is a pretty low bar. My guess is the author of this table isn't so strong on algorithms and hasn't explored what's beyond an introductory algorithms class.
Edit: the reason I say "pretty sure" is because there are a lot of people who work on practical problems that are not in NP because the problem does not have well defined solutions. But in the context of the rest of the table, the author likely did not intend to make this fine distinction.