Title of article
The complexity of the Weight Problem for permutation groups
Author/Authors
Cameron، نويسنده , , Peter J. and Wu، نويسنده , , Taoyang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
8
From page
109
To page
116
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.
Keywords
Weight Problem , metrics , Permutation group , NP-complete
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454549
Link To Document