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 language | English |
---|---|
Pages (from-to) | 84-94 |
Number of pages | 11 |
Journal | Journal of Symbolic Computation |
Volume | 84 |
DOIs | |
State | Published - 1 Jan 2018 |
Keywords
- NP-completeness
- Nilpotent groups
- Polycyclic groups
- Subset sum problem