| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436059 | Theoretical Computer Science | 2007 | 12 Pages |
Abstract
We consider the swap distance and the element duplication distance. We show that the swap centre permutation problem is NP-complete. We show that the element duplication centre problem is NP-complete.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
