推 Hatred:他是說"strong evidence",沒有說circuit SAT 140.112.30.113 05/31
→ Hatred:沒有polynomial time演算法:) 140.112.30.113 05/31
推 Eventis:還沒發現不等於沒有啊XD 61.62.49.43 05/31
→ Eventis:這個證明好像在做P != NP 61.62.49.43 05/31
→ Eventis:不會比PNP簡單到哪裡去吧=.=" 61.62.49.43 05/31
推 klain:沒有polynomial-time演算法的問題充其量頂多可以 59.112.212.87 05/31
→ klain:說這個問題不在P裡面,但是不能說他是NP-complete 59.112.212.87 05/31
→ klain:要証NP-complete就要照著定義走 59.112.212.87 05/31
推 Eventis:0.0"...呃,原po問的東西不是這樣. 61.62.49.43 05/31
→ Eventis:他的已知是確定NPC........:) 61.62.49.43 05/31
→ Eventis:但是NPC並不保證真的不存在solution in P吧? 61.62.49.43 05/31
→ Eventis:NPC -> no solution in P <===....Orz... 61.62.49.43 05/31
→ Eventis:這個能證出來的話就不需要費心證明PNP了啊XD 61.62.49.43 05/31
→ Eventis:既然原po引用了ITA,那就看一下Thm34.4吧. 61.62.49.43 05/31
→ Eventis:這個問題跟PNP是等價的啊0.0 61.62.49.43 05/31