Sciweavers

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

12

DM
2010

favoriteEmaildiscussreport

82views more DM 2010»

The complexity of the weight problem for permutation and matrix groups

13 years 4 months ago

The complexity of the weight problem for permutation and matrix groups

Download designtheory.org

Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we show that this problem is NP-complete for many well-known metrics. An analogous problem in matrix groups, eigenvalue-free problem, and two related problems in permutation groups, the maximum and minimum weight problems, are also investigated in this paper. Key words: Weight Problem, Metrics, Permutation Group, NP-complete

Peter J. Cameron, Taoyang Wu

Real-time Traffic

Corresponding Weight Problem | DM 2010 | Permutation Group | Weight Problem |

claim paper

Related Content

» The complexity of the Weight Problem for permutation groups

» A dynamical systems approach to weighted graph matching

» Triangular systolic array with reduced latency for QRdecomposition of complex matrices

» Computing in Solvable 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

» Towards an optimised VLSI design algorithm for the constant matrix multiplication problem

» Structure of nonbinary regular ldpc cycle codes

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DM
Authors	Peter J. Cameron, Taoyang Wu

Comments (0)