<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph Isomorphism in Quasipolynomial Time · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1512.03547/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1512.03547/feed.xml" rel="self" type="application/rss+xml" /><item><title>Graph Isomorphism in Quasipolynomial Time — mentioned by gilleain</title><link>https://news.ycombinator.com/item?id=31693428</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.03547:31693428</guid><pubDate>Fri, 10 Jun 2022 12:58:12 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s now a _solved_ problem - both theoretically (with Babai et al&amp;#x27;s paper a few years ago) and practically (with nAUTy/Bliss, and similar software). Not sure what the key paper is, but &amp;quot;Graph isomorphism in quasipolynomial time&amp;quot; is at leas relevant: https://dl.acm.org/doi/10.1145/2897518.2897542 or perhaps, this arxiv paper: https://arxiv.org/abs/1512.03547 No idea about a quantum algorithm for GI&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — mentioned by openasocket</title><link>https://news.ycombinator.com/item?id=13127168</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.03547:13127168</guid><pubDate>Wed, 07 Dec 2016 23:27:45 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1512.03547 Note it was actually Quasipolynomial time, not true polynomial time. It&amp;#x27;s also a pretty recent paper, so it could turn out to have flaws.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — mentioned by Eifoov7h</title><link>https://news.ycombinator.com/item?id=11317882</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.03547:11317882</guid><pubDate>Sat, 19 Mar 2016 09:25:24 GMT</pubDate><description>&lt;p&gt;That&amp;#x27;s a classic motte-and-bailey doctrine right there. It shows Taleb commenting on a topic he clearly knows nothing about while presenting himself as an expert. Something, if I recall correctly, he often criticises in other people. And it&amp;#x27;s not merely being imprecise, it&amp;#x27;s at least halfway between being wrong and not even wrong. If someone&amp;#x27;s that sloppy on Twitter, why would their research be any better? It probably isn&amp;#x27;t. In a series of tweets posted around the same time, Taleb also pointed to a &amp;quot;technical&amp;quot; paper claiming a connection between P versus NP and the effects of GMOs [1]. It&amp;#x27;s…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — HN submission</title><link>https://news.ycombinator.com/item?id=10786874</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.03547:10786874</guid><pubDate>Thu, 24 Dec 2015 03:05:38 GMT</pubDate><description>&lt;p&gt;Graph Isomorphism in Quasipolynomial Time&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — mentioned by acallan</title><link>https://news.ycombinator.com/item?id=10740211</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.03547:10740211</guid><pubDate>Tue, 15 Dec 2015 20:22:49 GMT</pubDate><description>&lt;p&gt;Indeed. And the big news is that the paper is available today. http://arxiv.org/abs/1512.03547v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — mentioned by gre</title><link>https://news.ycombinator.com/item?id=10739298</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.03547:10739298</guid><pubDate>Tue, 15 Dec 2015 18:05:54 GMT</pubDate><description>&lt;p&gt;Graph Isomorphism in Quasipolynomial Time: http://arxiv.org/abs/1512.03547&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — HN submission</title><link>https://news.ycombinator.com/item?id=10735861</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.03547:10735861</guid><pubDate>Tue, 15 Dec 2015 04:04:39 GMT</pubDate><description>&lt;p&gt;Graph isomorphism is quasi-polynomial time by Laci Babai&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — HN submission</title><link>https://news.ycombinator.com/item?id=10730670</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.03547:10730670</guid><pubDate>Mon, 14 Dec 2015 12:43:28 GMT</pubDate><description>&lt;p&gt;Graph Isomorphism in Quasipolynomial Time&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;16 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Graph Isomorphism in Quasipolynomial Time — HN submission</title><link>https://news.ycombinator.com/item?id=10729128</link><guid isPermaLink="false">urn:hackerpapers:submission:1512.03547:10729128</guid><pubDate>Mon, 14 Dec 2015 02:40:47 GMT</pubDate><description>&lt;p&gt;Graph Isomorphism in Quasipolynomial Time (Babai&amp;#x27;s Preprint)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;7 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1512.03547/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
