Knapsack problems in groups

  title={Knapsack problems in groups},
  author={Alexei G. Myasnikov and Andrey Nikolaev and Alexander Ushakov},
We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in hyperbolic groups and give various examples of finitely presented groups where the subset sum problem is NP-complete. 

Knapsack problems in products of groups

Knapsack problems in products of groups Elizaveta

The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and

The Complexity of Knapsack in Graph Groups

Here, the exact complexity of the knapsack problem for every graph group is determined and it is found that for every remaining graph, the problem is NP-complete.

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

Compressed Decision Problems in Hyperbolic Groups

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words

Knapsack problem for nilpotent groups

The main result of this paper is that the knapsack problem is undecidable for any torsion-free group of nilpotency class 2 if the rank of the derived subgroup is at least 316.

On subset sum problem in branch groups

It is shown that the subset sum problem is NP-complete in the first Grigorchuk group, and NP-hardness of that problem in weakly regular branch groups, which implies NP-completeness if the group is, in addition, contracting.

Non-commutative lattice problems

This work finds polynomial time solutions to problems like finding a sub group element closest to a given group element, or finding a shortest nontrivial element of a subgroup in the case of nilpotent groups, and a large class of surface groups and Coxeter groups.

Knapsack Problems for Wreath Products

It is shown that for every non-trivial abelian group $G$ knapsack (as well as the related subset sum problem) for the wreath product $G \wr \mathbb{Z}$ is NP-complete.



Isoperimetric functions of groups and computational complexity of the word problem

We prove that the word problem of a finitely generated group G is in NP (solvable in polynomial time by a nondeterministic Turing machine) if and only if this group is a subgroup of a finitely

Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have a uniform membership problem solvable in quadratic time. If a group in the class satisfies a further

Occurrence problem for free solvable groups

We study the problem on the existence of an algorithm verifying whether systems of linear equations over a group ring of a free metabelian group are solvable. The occurrence problem for free solvable

Tilings and Submonoids of Metabelian Groups

It is shown that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product ℤ≀(ℤ×ℬ) and the proof involves an encoding of Turing machines via tilings.

Random van Kampen diagrams and algorithmic problems in groups

A new filling function, the depth of van Kampen diagrams, is introduced and study – a crucial algorithmic characteristic of null-homotopic words in the group.


Wreath products such as Z ? Z are not finitely presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z ? Z as a subgroup of Thompson?s group F and as

The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.

Length and Area Functions on Groups and Quasi-Isometric Higman Embeddings

We survey recent results about asymptotic functions of groups, obtained by the authors in collaboration with J.-C. Birget, V. Guba and E. Rips. We also discuss methods used in the proofs of these

Quadratic equations over free groups are NP-complete

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete