<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph isomorphisms in quasi-polynomial time · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1710.04574/</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/1710.04574/feed.xml" rel="self" type="application/rss+xml" /><item><title>Graph isomorphisms in quasi-polynomial time — mentioned by svat</title><link>https://news.ycombinator.com/item?id=20006969</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.04574:20006969</guid><pubDate>Sat, 25 May 2019 03:41:49 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s an expository paper by Harald Helfgott that goes into earlier work, more foundational stuff, etc — even has exercises: https://arxiv.org/abs/1710.04574 (Originally presented for the Bourbaki Seminar, so not exactly for the non-mathematician, but has more context than reading the paper directly.)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.04574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GR</category></item></channel></rss>
