P NP NP-complete NP-hard
Some notes when learning complexity theory:
P: Problems can be solved in polynomial time. For example, multiplication, sort...
NP: The result of NP problem can be verified in polynomial time. For ex...
原创
2018-09-18 21:19:17 ·
524 阅读 ·
0 评论