AI Chat AI Image Generator AI Video Text to Speech

On subset sum problem in branch groups

06/04/2020

∙

by Andrey Nikolaev, et al.

∙

∙

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.

Andrey Nikolaev
3 publications
Alexander Ushakov
2 publications

page 1

page 2

page 3

page 4

research

∙ 01/04/2020

On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound

Given n positive integers a_1,a_2,...,a_n, and a positive integer right ...

0 Mustafa Kemal Tural, et al. ∙

research

∙ 03/14/2020

A novel and efficient algorithm to solve subset sum problem

In this paper we suggest analytical methods and associated algorithms fo...

0 B. Sinchev, et al. ∙

research

∙ 02/26/2018

On Strong NP-Completeness of Rational Problems

The computational complexity of the partition, 0-1 subset sum, unbounded...

0 Dominik Wojtczak, et al. ∙

research

∙ 04/28/2020

A Branch and Bound Algorithm for Coalition Structure Generation over Graphs

We give a column generation based branch and bound algorithm for coaliti...

0 Emanuel Florentin Olariu, et al. ∙

research

∙ 01/23/2023

The Identity Problem in the special affine group of ℤ^2

We consider semigroup algorithmic problems in the Special Affine group 𝖲...

0 Ruiwen Dong, et al. ∙

research

∙ 03/20/2022

Subset Sum in O(n^16log(n))

This extensive revision of my paper "Description of an O(poly(n)) Algori...

0 Rion Tolchin, et al. ∙

research

∙ 02/21/2022

A Probabilistic Approach to The Perfect Sum Problem

The subset sum problem is known to be an NP-hard problem in the field of...

0 Kristof Pusztai, et al. ∙