scientific article; zbMATH DE number 96386

MaRDI QIDQ4020767zbMATH OpenFDO

Authors William M. Kantor

Publication date 17 January 1993

zbMATH Keywords

central seriesderived seriesefficient algorithmsgraph isomorphism problemnilpotencypermutation groups of small degreepolynomial-time algorithmsimplicitysolvabilitysubgroups of \(S_ n\)Sylow's theorems

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sylow's theorem in polynomial time
• Polynomial-time versions of Sylow's theorem
• scientific article; zbMATH DE number 4136201
• scientific article; zbMATH DE number 4057755
• scientific article; zbMATH DE number 475362

Cited in

(26)

• Parallel algorithms for solvable permutation groups
• Computing with group homomorphisms
• Graph isomorphism problem and 2-closed permutation groups
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Primitive normalisers in quasipolynomial time
• Computing normalisers of intransitive groups
• Polynomial-time isomorphism test for groups with abelian Sylow towers.
• Representing Groups on Graphs
• Finding Sylow normalizers in polynomial time
• scientific article; zbMATH DE number 4136201 (Why is no real title available?)
• scientific article; zbMATH DE number 4163139 (Why is no real title available?)
• Polynomial-time versions of Sylow's theorem
• scientific article; zbMATH DE number 4057755 (Why is no real title available?)
• scientific article; zbMATH DE number 1256646 (Why is no real title available?)
• scientific article; zbMATH DE number 475362 (Why is no real title available?)
• scientific article; zbMATH DE number 1775057 (Why is no real title available?)
• Polynomial-time normalizers
• Quotient tests and random walks in computational group theory.
• A note on short cosets
• A Polynomial Time Nilpotence Test for Galois Groups and Related Results
• Two-closure of odd permutation group in polynomial time
• A subquadratic algorithm for the simultaneous conjugacy problem
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality
• The complexity of inversion in groups
• Collection from the left and other strategies

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 Q4020767)