批踢踢實業坊
›
看板
Grad-ProbAsk
關於我們
聯絡資訊
返回看板
作者
da0910cc (da0910cc)
看板
Grad-ProbAsk
標題
[理工] [演算法] NP問題
時間
Thu May 26 22:14:52 2011
consider a NP-complete problem.Is it meaningful to give a lower bound of this NP-complete problem? Does it make sense to talk about the upper bound of this problem? --
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.33.11.68
推
FRAXIS
:兩邊都有意義吧
05/27 02:37