On the complexity of diameter and related problems in permutation groups

DOI10.4230/LIPICS.ICALP.2023.134MaRDI QIDQ6638144

Markus Lohrey, Andreas Rosowski

Publication date: 14 November 2024

zbMATH Keywords

algorithms for finite groupsdiameter of permutation groupsrational subsets in groups

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Applications of finite non-abelian simple groups to cryptography in the quantum era

This page was built for publication: On the complexity of diameter and related problems in permutation groups

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