Efficient isomorphism testing for a class of group extensions

DOI10.4230/LIPICS.STACS.2009.1830MaRDI QIDQ5390013zbMATH OpenFDO

Authors François Le Gall

Publication date 24 April 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_3d12.html

zbMATH Keywords

black-box groupsgroup isomorphismpolynomial-time algorithms

Mathematics Subject Classification ID

Automorphisms, homomorphisms, endomorphisms, etc. for abelian groups (20K30) Extensions of abelian groups (20K35) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An efficient quantum algorithm for some instances of the group isomorphism problem
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
• An O(n) algorithm for Abelian p-group isomorphism and an O(n n) algorithm for Abelian group isomorphism
• Polynomial-time isomorphism test of groups that are tame extensions (extended abstract)

Cited in

(18)

• On isomorphism testing of a class of 2-nilpotent groups
• Isomorphism testing for \(p\)-groups
• On isomorphism testing of groups with normal Hall subgroups
• Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
• Isomorphism in expanding families of indistinguishable groups.
• Classical and quantum algorithms for testing equivalence of group extensions
• An efficient quantum algorithm for some instances of the group isomorphism problem
• Polynomial-time isomorphism test of groups that are tame extensions (extended abstract)
• A fast isomorphism test for groups whose Lie algebra has genus 2
• Algorithms for group isomorphism via group extensions and cohomology
• scientific article; zbMATH DE number 278890 (Why is no real title available?)
• Nearly linear time isomorphism algorithms for some nonabelian group classes
• Faster isomorphism for p-groups of class 2 and exponent p
• Count-free Weisfeiler-Leman and group isomorphism
• 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

This page was built for publication: Efficient isomorphism testing for a class of group extensions

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