TY - JOUR
T1 - ON THE SUBSET SUM PROBLEM IN BRANCH GROUPS
AU - Nikolaev, Andrey
AU - Ushakov, Alexander
N1 - Publisher Copyright:
© Andrey Nikolaev and Alexander Ushakov.
PY - 2020
Y1 - 2020
N2 - We consider a group-theoretic analogue of the classical 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.
AB - We consider a group-theoretic analogue of the classical 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.
KW - Grigorchuk group
KW - NP-completeness
KW - branch groups
KW - subset sum problem
UR - http://www.scopus.com/inward/record.url?scp=85161030246&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85161030246&partnerID=8YFLogxK
U2 - 10.46298/jgcc.2020.12.1.6541
DO - 10.46298/jgcc.2020.12.1.6541
M3 - Article
AN - SCOPUS:85161030246
SN - 1867-1144
VL - 12
JO - Groups, Complexity, Cryptology
JF - Groups, Complexity, Cryptology
IS - 1
ER -