scientific article

DOI10.4230/LIPICS.STACS.2011.567zbMath1230.68114MaRDI QIDQ3113720

M. N. Jayalal Sarma, Bang-Sheng Tang, Youming Qiao

Publication date: 23 January 2012

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

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

zbMATH Keywords

computational complexitynormal Hall subgroupsgroup isomorphism problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Space efficient representations of finite groups ⋮ Beating the generator-enumeration bound for \(p\)-group isomorphism

This page was built for publication: