6 research outputs found
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form by SLPs, which generalizes the classical NP-completeness result of the integer knapsack problem. We also prove general transfer results: NP-membership of the knapsack problem is passed on to finite extensions, HNN-extensions over finite associated subgroups, and amalgamated products with finite identified subgroups
On subset sum problem in branch groups
We consider a group-theoretic analogue of the classic subset sum problem. In
this brief note, we show that the subset sum problem is NP-complete in the
first Grigorchuk group. More generally, we show NP-hardness of that problem in
weakly regular branch groups, which implies NP-completeness if the group is, in
addition, contracting.Comment: v3: final version for journal of Groups, Complexity, Cryptology.
arXiv admin note: text overlap with arXiv:1703.0740