开发者

P=NP: What are the most promising methods?

I know that P=NP has 开发者_如何学Gonot been solved up to now, but can anybody tell me something about the following: What are currently the most promising mathematical / computer scientific methods that could be helpful to tackle this problem? Or are there even none such methods known to be potentially helpful up to now? Is there any (free) compendium on this topic where I can find all / most of the research done in this area?


An excellent overview appeared last year in Communications of the ACM. I think it became the most downloaded article of CACM ever, so your question may be relevant after all :-)

The Status of the P=NP Problem, Lance Fortnow, Communications of the ACM, Vol. 52 No. 9, 2009

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜