Subset sum problem in polycyclic groups
classification
🧮 math.GR
cs.CCmath.CO
keywords
problemsubseteverygrouppolycyclicanalogueclassicconsider
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.