Faster isomorphism for p-groups of class 2 and exponent p
From MaRDI portal
Publication:6499240
DOI10.1145/3564246.3585250MaRDI QIDQ6499240FDOQ6499240
Authors: Xiaorui Sun
Publication date: 8 May 2024
Cites Work
- Title not available (Why is that?)
- On Spaces of Linear Transformations with Bounded Rank
- Random Graph Isomorphism
- Title not available (Why is that?)
- On the order of uniprimitive permutation groups
- Faster canonical forms for primitive coherent configurations (extended abstract)
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Title not available (Why is that?)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Canonisation and Definability for Graphs of Bounded Rank Width
- Graph isomorphism problem
- Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space
- Decomposing \(p\)-groups via Jordan algebras.
- Isomorphism in expanding families of indistinguishable groups.
- Finding central decompositions of \(p\)-groups.
- Computing isometry groups of Hermitian maps
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- Quasipolynomial-time canonical form for steiner designs
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- Isomorphism testing for \(p\)-groups
- An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
- Linear time algorithms for Abelian group isomorphism and related problems
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- Polynomial-time isomorphism test for groups with abelian Sylow towers.
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- A fast isomorphism test for groups whose Lie algebra has genus 2
- Title not available (Why is that?)
- Efficient isomorphism testing for a class of group extensions
- Title not available (Why is that?)
- Groups with Abelian Central Quotient Group
- Graph isomorphism in quasipolynomial time (extended abstract)
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
- An improved isomorphism test for bounded-tree-width graphs
- On isomorphism testing of groups with normal Hall subgroups
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
- Normalizes and permutational isomorphisms in simply-exponential time
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- General linear group action on tensors: a candidate for post-quantum cryptography
- On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- On the Weisfeiler-Leman dimension of finite groups
- On the Rank of a p-Group of Class 2
- Canonical form for graphs in quasipolynomial time: preliminary report
- Isomorphism Testing for Graphs Excluding Small Minors
This page was built for publication: Faster isomorphism for \(p\)-groups of class 2 and exponent \(p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499240)