Complexity of identifying fitting-free groups
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1318518 (Why is no real title available?)
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 6783478 (Why is no real title available?)
- scientific article; zbMATH DE number 3303153 (Why is no real title available?)
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Algorithms for group isomorphism via group extensions and cohomology
- An optimal lower bound on the number of variables for graph identification
- Automorphism group computation and isomorphism testing in finite groups
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- Canonizing graphs of bounded rank-width in parallel via Weisfeiler-Leman
- Combinatorial approaches to the group isomorphism problem
- Constant depth circuit complexity for generating quasigroups
- Construction of finite groups
- Count-free Weisfeiler-Leman and group isomorphism
- Graph Isomorphism is in SPP
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism is in the low hierarchy
- Graph isomorphism is low for PP
- Graph isomorphism is not \(\mathsf{AC}^{0}\)-reducible to group isomorphism
- Graph isomorphism problem
- Group isomorphism is nearly-linear time for most orders
- Is code equivalence easy to decide?
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
- On the Hardness of Graph Isomorphism
- On the Weisfeiler-Leman dimension of finite groups
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the descriptive complexity of groups without abelian normal subgroups (extended abstract)
- On the parallel complexity of Group Isomorphism via Weisfeiler-Leman
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- Small-diameter Cayley graphs for finite simple groups
- The threshold for subgroup profiles to agree is $\Omega(\log n)$
- Which problems have strongly exponential complexity?
This page was built for publication: Complexity of identifying fitting-free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852224)
