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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

I've proved that p=np

2 点作者 guilamu大约 9 年前
http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1205.6658<p>...and no one wants to&#x2F;is able refute me.

4 条评论

GFK_of_xmaspast大约 9 年前
(a) if Feldmann really has a P solution to 3-SAT by reducing it to LP, surely he can demonstrate this empirically, there&#x27;s plenty of solvers out there for both LP and 3-SAT. (b) the reduction of 3-SAT to ILP is classical (<a href="http:&#x2F;&#x2F;www.cs.berkeley.edu&#x2F;~vazirani&#x2F;s99cs170&#x2F;notes&#x2F;npc.pdf" rel="nofollow">http:&#x2F;&#x2F;www.cs.berkeley.edu&#x2F;~vazirani&#x2F;s99cs170&#x2F;notes&#x2F;npc.pdf</a> and <a href="http:&#x2F;&#x2F;www.cs.cmu.edu&#x2F;afs&#x2F;cs&#x2F;academic&#x2F;class&#x2F;15451-s10&#x2F;www&#x2F;recitations&#x2F;rec0408.txt" rel="nofollow">http:&#x2F;&#x2F;www.cs.cmu.edu&#x2F;afs&#x2F;cs&#x2F;academic&#x2F;class&#x2F;15451-s10&#x2F;www&#x2F;re...</a> are two quick examples) (c) Just skimming, I don&#x27;t immediately see any reason to believe that the solutions to Feldmann&#x27;s LP formulation will be integral.
评论 #11306805 未加载
deadgrey19大约 9 年前
Perhaps you should submit this to a real journal rather than hacker news? Real experts might be the right people to refute you. May I suggest the Journal of Complexity (<a href="http:&#x2F;&#x2F;www.journals.elsevier.com&#x2F;journal-of-complexity&#x2F;" rel="nofollow">http:&#x2F;&#x2F;www.journals.elsevier.com&#x2F;journal-of-complexity&#x2F;</a>) or perhaps the Journal of Systems Science and Complexity (<a href="http:&#x2F;&#x2F;www.springer.com&#x2F;mathematics&#x2F;applications&#x2F;journal&#x2F;11424" rel="nofollow">http:&#x2F;&#x2F;www.springer.com&#x2F;mathematics&#x2F;applications&#x2F;journal&#x2F;114...</a>)
评论 #11306797 未加载
tgflynn大约 9 年前
It&#x27;s easy to formulate 3-SAT as an LP feasibility problem. The problem is that you need solutions in which all variables are either 0 or 1. That makes it an integer or 0-1 LP problem and such problems are NP hard.
评论 #11306743 未加载
guilamu大约 9 年前
Not really me, just a mathematician friend who has no clue on how to post on HN.