Normalizes and permutational isomorphisms in simply-exponential time

DOI10.1137/1.9781611975994.14MaRDI QIDQ5146779zbMATH OpenOpenAlexFDO

Authors Daniel Wiebking

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.10454

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(12)

• Primitive normalisers in quasipolynomial time
• Computing normalisers of intransitive groups
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• scientific article; zbMATH DE number 549085 (Why is no real title available?)
• scientific article; zbMATH DE number 1015107 (Why is no real title available?)
• scientific article; zbMATH DE number 2151233 (Why is no real title available?)
• Towards efficient normalizers of primitive groups
• Normalisers of primitive permutation groups in quasipolynomial time
• Normalizers and permutational isomorphisms in simply-exponential time
• Faster isomorphism for p-groups of class 2 and exponent p
• Graph isomorphism in quasipolynomial time parameterized by treewidth
• Computational group theory: bedrock and new frontiers

This page was built for publication: Normalizes and permutational isomorphisms in simply-exponential time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146779)