Given a subset P of all the possible permutations of a fixed set of elements, is there a non-exponential or optimized algorithm for computing the smallest composition of P that yields the identity permutation?
Algorithm to compose identity from a set of permutations
algorithms;complexity theory;combinatorics;permutations