You're right.If don't think about first and last Nbs.Erler paths

來源: jinjing 於 2010-04-13 18:52:23 [] [舊帖] [給我悄悄話] 閱讀數 : (98 bytes)
本帖於 2010-04-15 10:02:55 時間, 由版主 於德利 編輯

You are right about Computational complexity theory.I t is inpposible for big n even for computer.

請您先登陸，再發跟帖！