Algorithm学习记录-花瓣网|陪你做生活的设计师 | NP, NP-complete, and NP-hard set of problems. Under the assumption that P≠NP, the existence of problems within NP but outside both P and NP-complete was established by Ladner.[1]