Knapsack Problems in Groups
Group Theory
2015-08-12 v1 Computational Complexity
Combinatorics
Abstract
We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in hyperbolic groups and give various examples of finitely presented groups where the subset sum problem is NP-complete.
Cite
@article{arxiv.1302.5671,
title = {Knapsack Problems in Groups},
author = {Alexei Myasnikov and Andrey Nikolaev and Alexander Ushakov},
journal= {arXiv preprint arXiv:1302.5671},
year = {2015}
}
Comments
28 pages, 12 figures