109
click to vote
ECCC
2006
15 years 2 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...