The complexity of the Weight Problem for permutation groups

DOI10.1016/J.ENDM.2007.01.034MaRDI QIDQ3439572zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron, Taoyang Wu

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.01.034

zbMATH Keywords

metricsNP-complete problemspermutation groupsweight problem

Mathematics Subject Classification ID

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

Recommendations

• The complexity of the weight problem for permutation and matrix groups.
• Linear optimization over permutation groups
• Algorithmic Problems for Metrics on Permutation Groups
• On the subgroup distance problem.
• The distance of a permutation from a subgroup of S_n.

Cites work

• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• Linear optimization over permutation groups
• Metrics on permutations, a survey
• On the number of fixed point free elements in a permutation group
• On the subgroup distance problem.

Cited in

(3)

• On the subgroup distance problem.
• Algorithmic Problems for Metrics on Permutation Groups
• The complexity of the weight problem for permutation and matrix groups.

This page was built for publication: The complexity of the Weight Problem for permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439572)