Nearly linear time isomorphism algorithms for some nonabelian group classes
From MaRDI portal
Recommendations
- Nearly linear time isomorphism algorithms for some nonabelian group classes
- Polynomial-time isomorphism test for groups with abelian Sylow towers.
- An O(n) algorithm for Abelian p-group isomorphism and an O(n n) algorithm for Abelian group isomorphism
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Linear time algorithms for Abelian group isomorphism and related problems
Cited in
(12)- An O(n) algorithm for Abelian p-group isomorphism and an O(n n) algorithm for Abelian group isomorphism
- Compact data structures for Dedekind groups and finite rings
- Linear time algorithms for Abelian group isomorphism and related problems
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- A fast isomorphism test for groups whose Lie algebra has genus 2
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Nearly linear time isomorphism algorithms for some nonabelian group classes
- 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)
- A systematic study of isomorphism invariants of finite groups via the Weisfeiler-Leman dimension
This page was built for publication: Nearly linear time isomorphism algorithms for some nonabelian group classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919682)