1 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Richard G. E. Pinch
We show that the problem of computing the distance of a given permutation from a subgroup H of Sn is in general NP-complete, even under the restriction that H is elementary…