2 citations · 2 across the 4 of their papers we have counts for
Showing 2025 · math.GRShow all
2 papers · 2 filters
math.GR2025
On the Subgroup Distance Problem in Cyclic Permutation Groups
Andreas Rosowski
We show that the Subgroup distance problem regarding the Hamming distance, the Cayley distance and the distance is NP-complete when the input group is cyclic. When we re…
math.GR2025
Finding cycle types in permutation groups with few generators
Markus Lohrey, Andreas Rosowski
The problem whether a given permutation group contains a permutation with a given cycle type is studied. This problem is known to be NP-complete. In this paper it is shown that the…