scientific article

From MaRDI portal
Publication:3895641

zbMath0449.20002MaRDI QIDQ3895641

Charles C. Sims

Publication date: 1971


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

On the fixing sets of dihedral groupsA general backtrack algorithm for the isomorphism problem of combinatorial objectsGeneration of Colourings and Distinguishing Colourings of GraphsOn an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating PermutationsPerfect refiners for permutation group backtracking algorithmsComputing in permutation and matrix groups. III: Sylow subgroupsBase sizes for sporadic simple groups.Fixing numbers of graphs with symmetric and generalized quaternion symmetry groupsOn the diameter of permutation groups.Efficient representation of perm groupsFinite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las VegasAlgorithms for polycyclic-by-finite groupsThe computation of normalizers in permutation groupsNew methods for using Cayley graphs in interconnection networksProcessor interconnection networks from Cayley graphsComplexity classes of equivalence problems revisitedConstruction of the irreducible modular representations of a finite groupOn base sizes for almost simple primitive groupsSimple groups, fixed point ratios and applicationsDisjoint direct product decompositions of permutation groupsOn the subgroup distance problem.Linear optimization over permutation groupsComputing with groups and their character tablesGraph isomorphism is low for PPAlgorithms for matrix groups and the Tits alternativeSubcomplete generalizations of graph isomorphismGrowth in groups: ideas and perspectivesEffective computation with group homomorphisms