Factoring Groups Efficiently

DOI10.1007/978-3-642-02927-1_49zbMath1248.68250OpenAlexW1545113110MaRDI QIDQ3638065

Neeraj Kayal, Timur I. Nezhmetdinov

Publication date: 14 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_49

Mathematics Subject Classification ID

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

Related Items (10)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ On isomorphism testing of groups with normal Hall subgroups ⋮ On the class of KN-complete groups ⋮ Space efficient representations of finite groups ⋮ Tensor products of coherent configurations ⋮ On computing the closures of solvable permutation groups ⋮ Compact data structures for Dedekind groups and finite rings ⋮ Nearly linear time isomorphism algorithms for some nonabelian group classes ⋮ Disjoint direct product decompositions of permutation groups ⋮ Uniformly Automatic Classes of Finite Structures

This page was built for publication: Factoring Groups Efficiently