Pages that link to "Item:Q2843234"
From MaRDI portal
The following pages link to Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups (Q2843234):
Displaying 15 items.
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- On isomorphism testing of a class of 2-nilpotent groups (Q1174452) (← links)
- Filters compatible with isomorphism testing (Q2200949) (← links)
- Isomorphism testing of groups of cube-free order (Q2282990) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
- Polynomial-time isomorphism test for groups with abelian Sylow towers. (Q2904784) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q3113720) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191525) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Nearly linear time isomorphism algorithms for some nonabelian group classes (Q5918355) (← links)
- Testability in group theory (Q6076186) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- Linear space data structures for finite groups with constant query-time (Q6547214) (← links)
