Babai’s Result: Still a Breakthrough — Gödel’s Lost Letter and P=NP

Even after today’s retraction of quasi-polynomial time for graph isomorphism László Babai is famous for many things, and has made many seminal contributions to complexity theory. Last year he claimed that Graph Isomorphism (GI) is in quasi-polynomial time. Today Laci posted a retraction of this claim, conceding that the proof has a […]

via Babai’s Result: Still a Breakthrough — Gödel’s Lost Letter and P=NP

The original letter explaining the retraction of the quasipolynomial claim can be found here. As explained in the blog post above and in the letter, the modified subexponential result is still very significant.

Advertisements
This entry was posted in Algorithms, Math and tagged , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s