Author:
Danan Eiran,Falcón Raúl M.,Kotlar Dani,Marbach Trent G.,Stones Rebecca J.
Funder
NSF of China
Science and Technology Development Plan of Tianjin, China
Fundamental Research Funds for the Central Universities, China
SAFEA, China
Thousand Youth Talents Plan in Tianjin, China
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference53 articles.
1. Colouring games based on autotopisms of Latin hyper-rectangles;Andres;Quaest. Math.,2019
2. A note on the automorphisms of special loops;Artzy;Riv. Lemat.,1954
3. L. Babai, Graph isomorphism in quasipolynomial time, in: Proc. 48th ACM STOC, 2016, pp. 684–697.
4. L. Babai, W.M. Kantor, E.M. Luks, Computational complexity and the classification of finite simple groups, in: Proc. 24th IEEE FOCS, 1983, pp. 162–171.
5. Latin squares with highly transitive automorphism groups;Bailey;J. Aust. Math. Soc.,1982
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献