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.
Original language | English |
---|---|
Pages (from-to) | 109-116 |
Number of pages | 8 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 28 |
DOIs | |
Publication status | Published - 1 Mar 2007 |
Keywords
- Metrics
- NP-complete
- Permutation Group
- Weight Problem