Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

43

Voted

ENDM
2007

favoriteEmaildiscussreport

64views more ENDM 2007»

The complexity of the Weight Problem for permutation groups

13 years 10 months ago

The complexity of the Weight Problem for permutation groups

Download www.maths.qmw.ac.uk

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.

Peter J. Cameron, Taoyang Wu

Real-time Traffic

Corresponding Weight Problem | ENDM 2007 | Metric | Permutation Group |

claim paper

Related Content

» The complexity of the weight problem for permutation and matrix groups

» Almost kwise vs kwise independent permutations and uniformity for general group actions

» Increased sensitivity in FMRI group analysis using mixedeffect modeling

» Sorting by Weighted Reversals Transpositions and Inverted Transpositions

» On the Subgroup Distance Problem

» Graph Isomorphism is in SPP

» Inferring rankings under constrained sensing

» Some babystep giantstep algorithms for the low hamming weight discrete logarithm problem

» Fastanova an efficient algorithm for genomewide association study

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENDM
Authors	Peter J. Cameron, Taoyang Wu

Comments (0)