暂无分享,去创建一个
[1] James B. Wilson. Finding direct product decompositions in polynomial time , 2010, 1005.0548.
[2] D. G. Higman. Coherent configurations , 1975 .
[3] W. Imrich,et al. Handbook of Product Graphs, Second Edition , 2011 .
[4] H. Krause. Krull-Schmidt categories and projective covers , 2014, 1410.2822.
[5] Lajos Rónyai,et al. Polynomial time solutions of some problems of computational algebra , 1985, STOC '85.
[6] Alexandre Turull,et al. Algebraic decompositions of commutative association schemes , 1985 .
[7] Cheryl E. Praeger,et al. Permutation Groups and Cartesian Decompositions , 2018 .
[8] Bangteng Xu. Direct Products of Association Schemes and Tensor Products of Table Algebras , 2013 .
[9] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[10] James B. Wilson,et al. Existence, algorithms, and asymptotics of direct product decompositions, I , 2012, Groups Complex. Cryptol..
[11] Paul-Hermann Zieschang,et al. Theory of Association Schemes , 2005 .
[12] Neeraj Kayal,et al. Factoring Groups Efficiently , 2009, ICALP.
[13] Cheryl E. Praeger,et al. The geometry of diagonal groups , 2020, Transactions of the American Mathematical Society.