Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract
暂无分享,去创建一个
[1] László Babai,et al. Asymptotic Delsarte cliques in distance-regular graphs , 2015, Journal of Algebraic Combinatorics.
[2] Eugene M. Luks,et al. Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[3] László Babai,et al. Quasipolynomial-time canonical form for steiner designs , 2013, STOC '13.
[4] L. Babai. On the Order of Uniprimitive Permutation Groups , 1981 .
[5] Neil Immerman,et al. An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] R. Frucht. Herstellung von Graphen mit vorgegebener abstrakter Gruppe , 1939 .
[7] László Babai,et al. Computational complexity and the classification of finite simple groups , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Xi Chen,et al. Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems , 2013, STOC '13.
[9] Daniel A. Spielman,et al. Faster isomorphism testing of strongly regular graphs , 1996, STOC '96.
[10] A. Neumaier. Strongly regular graphs with smallest eigenvalue —m , 1979 .
[11] Klaus Metsch,et al. On a Characterization of Bilinear Forms Graphs , 1999, Eur. J. Comb..
[12] Shmuel Friedland,et al. On the graph isomorphism problem , 2008, ArXiv.
[13] P. Cameron. FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS , 1981 .
[14] László Babai,et al. On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..
[15] D. G. Higman. Coherent configurations , 1975 .
[16] Xi Chen,et al. Faster Canonical Forms for Strongly Regular Graphs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[17] D. G. Higman. Coherent configurations , 1975 .
[18] L. Babai. Monte-Carlo algorithms in graph isomorphism testing , 2006 .
[19] B. Weisfeiler. On construction and identification of graphs , 1976 .
[20] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[21] László Babai,et al. On the automorphism groups of strongly regular graphs II , 2015 .
[22] László Babai,et al. Canonical labeling of graphs , 1983, STOC.
[23] Gary L. Miller,et al. Graph isomorphism, general remarks , 1977, STOC '77.
[24] László Babai,et al. Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.