Hello CG-list, Thanks to László Babai graph isomorphism is known to be quasi-polynomial. Original paper : https://arxiv.org/abs/1512.03547 Live exposition : https://www.youtube.com/watch?v=r-nCYbX_Au0 This result generalizes well to hyper-graph isomorphism. Does that mean one could imagine a CoGUI version based around a weaker CG subsumption ? What would be the value of such a platform ? Regards, - damien -- Cet e-mail a été vérifié par le logiciel antivirus d'Avast. www.avast.com