Subset sum problem in polycyclic groups
Group Theory
2017-03-23 v1 Computational Complexity
Combinatorics
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.
Keywords
Cite
@article{arxiv.1703.07406,
title = {Subset sum problem in polycyclic groups},
author = {Andrey Nikolaev and Alexander Ushakov},
journal= {arXiv preprint arXiv:1703.07406},
year = {2017}
}
Comments
11 pages. To appear in Journal of Symbolic Computation