| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652824 | Electronic Notes in Discrete Mathematics | 2007 | 8 Pages |
Abstract
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this paper we show that this problem is NP-complete for many well known metrics.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
