Author:
Nikolaev Andrey,Ushakov Alexander
Abstract
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.07406
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献