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.

Complex problem made simple sends computer scientists wild

20 pointsby brianclementsover 9 years ago

3 comments

WalterSearover 9 years ago
<i>Babai declined to be interviewed about the work, saying it must first stand up to the scrutiny of peer review. “I understand that in the internet age, even a simple seminar announcement can trigger an explosion in the blogosphere, but this is no reason to compromise the process,” he says. “The reaction of colleagues at this point is not celebration but anticipation. The results need to be verified by the research community.</i><p>I say, bravo.
评论 #10553974 未加载
0xdeadbeefbabeover 9 years ago
&gt; Babai’s new result says that solving graph isomorphism takes slightly longer than polynomial time – not quite placing it in P, but significantly shifting the needle for the first time.<p>What is the needle and how did it shift significantly for the first time?<p>Edit: They already knew it was in NP, but now they know it is not in P (or not quite in P)?
评论 #10558566 未加载
评论 #10554321 未加载
i573323over 9 years ago
Now THAT&#x27;s a clickbaitey title.
评论 #10556304 未加载
评论 #10553938 未加载
评论 #10555639 未加载