TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ask YC: P = NP ?

4 点作者 btw0将近 17 年前
What's your idea?

6 条评论

xirium将近 17 年前
There's a huge financial incentive to solve this problem; it would significantly improve the efficiency of many business processes and it would make it trivial to crack many contemporary forms of encryption. The solution is worth billions, if not trillions. Furthermore, you've only got to find one example where P=NP and you can reduce many other problems to this case. Furthermore, there's a very large number of abstract and practical examples to work on. So why hasn't it been solved?<p>Has it been solved in secret? Are we not smart enough to solve the problem? Is there little incentive to prove that P!=NP? Do foolhardy attempts produce "good enough" improvements to existing practices?
评论 #215378 未加载
评论 #214907 未加载
dangoldin将近 17 年前
If you can solve Minesweeper in polynomial time, you've got it.<p><a href="http://www.claymath.org/Popular_Lectures/Minesweeper/" rel="nofollow">http://www.claymath.org/Popular_Lectures/Minesweeper/</a>
gaius将近 17 年前
N=1
评论 #214846 未加载
noodle将近 17 年前
P≠NP
superchink将近 17 年前
Is this a serious question?
MaysonL将近 17 年前
nil