Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups

DOI10.1007/978-3-642-31594-7_5MaRDI QIDQ2843234zbMATH OpenOpenAlexFDO

Authors László Babai, Paolo Codenotti, Youming Qiao

Publication date 12 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31594-7_5

zbMATH Keywords

code equivalencegroup isomorphismpermutational isomorphism

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Abstract finite groups (20D99) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Polynomial-time isomorphism test for groups with abelian Sylow towers.
• Polynomial-time isomorphism test of groups that are tame extensions (extended abstract)
• On isomorphism testing of groups with normal Hall subgroups
• On isomorphism testing of groups with normal Hall subgroups
• Nearly linear time isomorphism algorithms for some nonabelian group classes
• Nearly linear time isomorphism algorithms for some nonabelian group classes
• A Polynomial Time Nilpotence Test for Galois Groups and Related Results
• An O(n) algorithm for Abelian p-group isomorphism and an O(n n) algorithm for Abelian group isomorphism
• Polynomial-time Abelian groups
• Efficient isomorphism testing for a class of group extensions

Cited in

(26)

• On isomorphism testing of a class of 2-nilpotent groups
• Filters compatible with isomorphism testing
• Isomorphism testing of groups of cube-free order
• On isomorphism testing of groups with normal Hall subgroups
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• Polynomial-time isomorphism test for groups with abelian Sylow towers.
• On isomorphism testing of groups with normal Hall subgroups
• Minimum circuit size, graph isomorphism, and related problems
• Polynomial-time isomorphism test of groups that are tame extensions (extended abstract)
• Beating the generator-enumeration bound for \(p\)-group isomorphism
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Algorithms for group isomorphism via group extensions and cohomology
• Efficient isomorphism testing for a class of group extensions
• Nearly linear time isomorphism algorithms for some nonabelian group classes
• Testability in group theory
• Faster isomorphism for p-groups of class 2 and exponent p
• Count-free Weisfeiler-Leman and group isomorphism
• Linear space data structures for finite groups with constant query-time
• The minimal faithful permutation degree of groups without abelian normal subgroups
• Complexity of minimal faithful permutation degree for fitting-free groups
• Complexity of identifying fitting-free groups
• On the descriptive complexity of groups without abelian normal subgroups
• On the parallel complexity of group isomorphism via Weisfeiler-Leman
• On the descriptive complexity of groups without abelian normal subgroups (extended abstract)
• On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
• Reduction of the group isomorphism problem to the group automorphism problem

This page was built for publication: Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843234)