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.

请您先登陆，再发跟帖！