Computational complexity It is NP-complete to determine whether a given permutation group (described by a given set of permutations that generate it) contains any derangements.
Computational complexity It is NP-complete to determine whether a given permutation group (described by a given set of permutations that generate it) contains any derangements.