Follow
A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors. (arXiv:2002.04638v1 [cs.DS]) http://arxiv.org/abs/2002.04638
A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors. (arXiv:2002.04638v1 [cs.DS]) http://arxiv.org/abs/2002.04638