The distance of a permutation from a subgroup of S_n
| dc.creator | Pinch, Richard G. E. | |
| dc.date | 2005-11-20 | |
| dc.date.accessioned | 2026-07-07T06:51:31Z | |
| dc.date.available | 2026-07-07T06:51:31Z | |
| dc.description | We show that the problem of computing the distance of a given permutation from a subgroup $H$ of $S_n$ is in general NP-complete, even under the restriction that $H$ is elementary Abelian of exponent 2. The problem is shown to be polynomial-time equivalent to a problem related to finding a maximal partition of the edges of an Eulerian directed graph into cycles and this problem is in turn equivalent to the standard NP-complete problem of Boolean satisfiability. | |
| dc.description | 6 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/math/0511501 | |
| dc.identifier | http://arxiv.org/abs/math/0511501 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/105010 | |
| dc.subject | Combinatorics | |
| dc.subject | 20B40; 05C38, 20B35, 68Q25 | |
| dc.title | The distance of a permutation from a subgroup of S_n | |
| dc.type | text |