Subset sum problem in polycyclic groups

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every polycyclic non-virtually-nilpotent group has NP-complete subset sum problem.

Original languageEnglish
Pages (from-to)84-94
Number of pages11
JournalJournal of Symbolic Computation
Volume84
DOIs
StatePublished - 1 Jan 2018

Keywords

  • NP-completeness
  • Nilpotent groups
  • Polycyclic groups
  • Subset sum problem

Fingerprint

Dive into the research topics of 'Subset sum problem in polycyclic groups'. Together they form a unique fingerprint.

Cite this