On the subgroup distance problem.
type: Item
instance of: scholarly article
title: On the subgroup distance problem.
zbMATH Open document ID: 1208.20002
author: Christoph Buchheim
author: Taoyang Wu
author: Peter J. Cameron
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 20B35
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20B40
zbMATH DE Number: 5542393
zbMATH Keywords: permutation groups
zbMATH Keywords: subgroup distances
zbMATH Keywords: metrics
zbMATH Keywords: NP-complete problems
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.disc.2008.01.036
OpenAlex ID: W2133126231
cites work: On the inherent intractability of certain coding problems (Corresp.)
cites work: Linear optimization over permutation groups
cites work: The complexity of the Weight Problem for permutation groups
cites work: Q3995195
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Q4198056
cites work: Some NP-Complete Problems Similar to Graph Isomorphism
cites work: Q3221403
cites work: Q3077170
cites work: Q3895641
DOI: 10.1016/J.DISC.2008.01.036
description: scientific article; zbMATH DE number 5542393