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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Hamiltonian Cycle Problem is in P

6 点作者 ototot大约 4 年前

2 条评论

tsukikage大约 4 年前
What&#x27;s with the obsession with parallel computing? All the variations on &quot;this bit is O(N^3) but if you have N computers working on it in parallel it&#x27;s O(N^2)&quot; - that&#x27;s not how that notation works.<p>Next step for the author is to represent the RSA challenge number factorizations as Hamiltonian graph problems. Once they&#x27;ve claimed the prizes, we&#x27;ll know the paper is worth looking at.
thanatos519大约 4 年前
&quot;As a well-known problem in NPC, the Hamiltonian Cycle Problem can be now resolved practically in deterministic polynomial time, so this problem is in P and we prove that the conjecture of P=NP holds.&quot;<p>I&#x27;m skeptical, but the paper is short ...
评论 #27206617 未加载