scientific article; zbMATH DE number 3629194

zbMath0405.20001MaRDI QIDQ4190797

Charles C. Sims

Publication date: 1978

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

zbMATH Keywords

Subgroups of Finite IndexBurnside ProblemComputational Problem in Group TheoryCoset EnumerationFinitely Presented GroupsLargest Abelian Quotient GroupLow Index Subgroup AlgorithmReidemeister-Schreier AlgorithmSchreier-Todd-Coexter AlgorithmSuzuki Sporadic Simple Group

Mathematics Subject Classification ID

Simple groups: sporadic groups (20D08) Subgroup theorems; subgroup growth (20E07) Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04) Research exposition (monographs, survey articles) pertaining to group theory (20-02)

Related Items (13)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Classifying the finite simple groups ⋮ On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations ⋮ Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Isomorphism of graphs of bounded valence can be tested in polynomial time ⋮ Permutation group algorithms based on partitions. I: Theory and algorithms ⋮ Algebraic properties of cryptosystem PGM ⋮ Finite groups ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ Computing with groups and their character tables ⋮ Sylow's theorem in polynomial time ⋮ Finding fixed point free elements and small bases in permutation groups

This page was built for publication: