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 gr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Episciences
2020-06-01
|
| Series: | Groups, Complexity, Cryptology |
| Subjects: | |
| Online Access: | https://gcc.episciences.org/6541/pdf |