On the subgroup distance problem.

DOI10.1016/j.disc.2008.01.036zbMath1208.20002OpenAlexW2133126231MaRDI QIDQ1011736

Christoph Buchheim, Taoyang Wu, Peter J. Cameron

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.036

zbMATH Keywords

computational complexitypermutation groupsNP-complete problemsmetricssubgroup distances

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Subgroups of symmetric groups (20B35)

Related Items

Consolidation for compact constraints and Kendall tau LP decodable permutation codes, The complexity of the weight problem for permutation and matrix groups., Covering radius of permutation groups with infinity-norm, The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of abelian groups, The complexity of the Weight Problem for permutation groups

Cites Work

• Linear optimization over permutation groups
• The complexity of the Weight Problem for permutation groups
• Some NP-Complete Problems Similar to Graph Isomorphism
• On the inherent intractability of certain coding problems (Corresp.)
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item