Complex problem made simple sends computer scientists wild

<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.

&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)?

Now THAT&#x27;s a clickbaitey title.