scientific article; zbMATH DE number 3629194
zbMATH Open0405.20001MaRDI QIDQ4190797FDOQ4190797
Authors: Charles C. Sims 
Publication date: 1978
Title of this publication is not available (Why is that?)
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
Generators, relations, and presentations of groups (20F05) Finite nilpotent groups, (p)-groups (20D15) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Periodic groups; locally finite groups (20F50) Research exposition (monographs, survey articles) pertaining to group theory (20-02) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: sporadic groups (20D08)
Cited In (13)
- Permutation group algorithms based on partitions. I: Theory and algorithms
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Colored hypergraph isomorphism is fixed parameter tractable
- Finding fixed point free elements and small bases in permutation groups
- Sylow's theorem in polynomial time
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Computing with groups and their character tables
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- General linear group action on tensors: a candidate for post-quantum cryptography
- Finite groups
- Classifying the finite simple groups
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Algebraic properties of cryptosystem PGM
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190797)
