Faster isomorphism for \(p\)-groups of class 2 and exponent \(p\)
From MaRDI portal
Publication:6499240
DOI10.1145/3564246.3585250MaRDI QIDQ6499240
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- A fast isomorphism test for groups whose Lie algebra has genus 2
- Decomposing \(p\)-groups via Jordan algebras.
- Graph isomorphism problem
- On the order of uniprimitive permutation groups
- 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
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- General linear group action on tensors: a candidate for post-quantum cryptography
- On isomorphism testing of groups with normal Hall subgroups
- Linear time algorithms for Abelian group isomorphism and related problems
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- Isomorphism in expanding families of indistinguishable groups
- Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.
- Faster Canonical Forms for Primitive Coherent Configurations
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- On Spaces of Linear Transformations with Bounded Rank
- Finding central decompositions of p-groups
- On the Rank of a p-Group of Class 2
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Random Graph Isomorphism
- 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 the Weisfeiler-Leman Dimension of Finite Groups
- Normalizes and permutational isomorphisms in simply-exponential time
- Canonical form for graphs in quasipolynomial time: preliminary report
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
- Graph isomorphism in quasipolynomial time [extended abstract]
- Computing isometry groups of Hermitian maps
- On the nlog n isomorphism technique (A Preliminary Report)
- Quasipolynomial-time canonical form for steiner designs
- Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
- Groups with Abelian Central Quotient Group
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- Canonisation and Definability for Graphs of Bounded Rank Width
- Isomorphism Testing for Graphs Excluding Small Minors
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
This page was built for publication: Faster isomorphism for \(p\)-groups of class 2 and exponent \(p\)