Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference42 articles.
1. Isomorphism testing: Perspective and open problems;Arvind;Bull. Eur. Assoc. Theor. Comput. Sci. EATCS,2005
2. On the complexity of canonical labeling of strongly regular graphs;Babai;SIAM J. Comput.,1980
3. Automorphism groups, isomorphism, reconstruction;Babai,1995
4. L. Babai, P. Codenotti, Isomorphism of hypergraphs of low rank in moderately exponential time, in: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, 2008, pp. 667–676.
5. L. Babai, W.M. Kantor, E.M. Luks, Computational complexity and the classification of finite simple groups, in: Proc. 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, AZ, 1983, pp. 162–171.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献