- — Diego dE (@didest)Tue, Nov 10 2015 21:32:37Laci Babai, graph isomorphism in quasi-polynomial time, talk 1 https://twitter.com/gabegaster/status/664189423169445888 …
- — Gabriel Gaster (@gabegaster)Tue, Nov 10 2015 21:37:13Find a recurrence reduction to cut the idealized set into two pieces-- when it gets small enough (polylog) then brute force
- — Gabriel Gaster (@gabegaster)Tue, Nov 10 2015 21:40:16Canonical -- i.e. Operate on the structures, so that the theory passes through any isomorphism. I.e. Independent of labeling
- — Gabriel Gaster (@gabegaster)Tue, Nov 10 2015 21:41:32Goal: a canonical coloring (no color class larger than 90%) OR a canonical equi-partition -- so branching factor is bounded below 1/2
Livetweet of Babai's first Graph Isomorphism talk
Just @gabegaster 's tweets, no frills.
byPaul Johnson7,565 Views