TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

A Polynomial Time Algorithm for 3SAT (P=NP?!)

29 pointsby rmujicaalmost 4 years ago

6 comments

rmujicaalmost 4 years ago
Update: Apparently is going to be retracted, <a href="https:&#x2F;&#x2F;mobile.twitter.com&#x2F;rrwilliams&#x2F;status&#x2F;1417161397960646658" rel="nofollow">https:&#x2F;&#x2F;mobile.twitter.com&#x2F;rrwilliams&#x2F;status&#x2F;141716139796064...</a>
评论 #27884991 未加载
j_walteralmost 4 years ago
Yeah...probably not.<p>The article is poorly written and jumps to conclusions on a number of facts. Even the intro is just a jumble of random abstract thoughts like this:<p>&gt; Also there are famous scientists agree that NP=P. Hilbert, a great mathematician of the twentieth century, has a famous saying: we must know; we will know. It can be seen that Hilbert essentially agreed that NP equals P. Many mathematical problems in human history, including Hilbert&#x27;s famous 23 mathematical problems, are constantly being solved. Isn&#x27;t it a confirmation that NP equals P?<p>If they agree that NP=P, and not many of them do...but if you can&#x27;t prove it then you can&#x27;t just say because some people think it is then it is.
评论 #27884968 未加载
amichailalmost 4 years ago
<a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1004.3702" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1004.3702</a>
评论 #27884922 未加载
评论 #27884942 未加载
rmujicaalmost 4 years ago
Abstract:<p>&gt; By creating new concepts and methods—the checking tree, long unit path, direct contradiction unit pair, indirect contradiction unit pair, additional contradiction unit pair, two-unit layer and three-unit layer—we successfully transform solving a 3SAT problem to solving 2SAT problems in polynomial time.<p>&gt; Each time, we add only one layer of the three-unit layers to the two-unit layers to calculate 2SAT paths, respectively.<p>&gt; The key is as follows: in each 2SAT path, any two units cannot be a direct contradiction unit pair and cannot be an indirect contradiction unit pair and additional contradiction unit pair.<p>&gt; This guarantees that all of the 2SAT paths we got, respectively, can shape at least one long path without contradictions.<p>&gt; Thus, we proved that NP = P.
friseurterminalmost 4 years ago
From the paper:<p>&gt; The difference of an attribute value between any group of individuals in the objective world is usually in the same order of magnitude as the absolute value of an individual attribute. For example, one adult weighs 100 pounds, and the difference between a very fat man and a very thin man is also 100 pounds. Similarly, the weight of an ant is in grams, and the difference between a big ant and a small ant is also in grams. Of course, these are not strictly proven conclusions.<p>This seems... peculiar?<p>Yet also (Acknowledgements):<p>&gt; I would like to thank the editor-in-chief, the editors, and the reviewers of TOCT. They gave my paper a very patient and very good review.
评论 #27885037 未加载
评论 #27884987 未加载
jvanderbotalmost 4 years ago
That&#x27;d be so exciting for algorithm research for decades. It&#x27;s probably not true.