五千年(敝帚自珍)

主题:【原创】p(多项式算法)问题对np(非多项式算法)问题  -- 香山居士

共:💬18
全看分页树展 · 主题 跟帖
家园 NP-Complete problems are only a subset

of NP problems.

when you talk "如果你解决了一个NP问题,你就解决了所有的NP问题!", you are talking about NO-Complete problems. In fact, there are many hard problems which have no NP algorithms to solve them, and they are so far not proven to be NP-Complete.

correct me, if i am wrong.

全看分页树展 · 主题 跟帖


有趣有益,互惠互利;开阔视野,博采众长。
虚拟的网络,真实的人。天南地北客,相逢皆朋友

Copyright © cchere 西西河