Faster isomorphism for p-groups of class 2 and exponent p
From MaRDI portal
Publication:6499240
Cites work
- scientific article; zbMATH DE number 3741566 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256777 (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 fast isomorphism test for groups whose Lie algebra has genus 2
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
- An improved isomorphism test for bounded-tree-width graphs
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- Canonical form for graphs in quasipolynomial time: preliminary report
- Canonisation and Definability for Graphs of Bounded Rank Width
- Computing isometry groups of Hermitian maps
- Decomposing \(p\)-groups via Jordan algebras.
- Efficient isomorphism testing for a class of group extensions
- Faster canonical forms for primitive coherent configurations (extended abstract)
- Finding central decompositions of \(p\)-groups.
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- General linear group action on tensors: a candidate for post-quantum cryptography
- Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism problem
- Groups with Abelian Central Quotient Group
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- Isomorphism Testing for Graphs Excluding Small Minors
- Isomorphism in expanding families of indistinguishable groups.
- Isomorphism testing for \(p\)-groups
- Linear time algorithms for Abelian group isomorphism and related problems
- Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
- Normalizes and permutational isomorphisms in simply-exponential time
- On Spaces of Linear Transformations with Bounded Rank
- On isomorphism testing of groups with normal Hall subgroups
- On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- On the Rank of a p-Group of Class 2
- On the Weisfeiler-Leman dimension of finite groups
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the order of uniprimitive permutation groups
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- Polynomial-time isomorphism test for groups with abelian Sylow towers.
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Quasipolynomial-time canonical form for steiner designs
- Random Graph Isomorphism
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
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)