Subset sum problem in polycyclic groups

Andrey Nikolaev, Alexander Ushakov

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment