2 citations · 9 across the 12 of their papers we have counts for
3 papers · 1 filter
A characterization of wreath products where knapsack is decidable
Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche
The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group and takes as input group elements $g_1,\ldot…
The complexity of knapsack problems in wreath products
Michael Figelius, Moses Ganardi, Markus Lohrey +1
We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we s…
Knapsack Problems for Wreath Products
Moses Ganardi, Daniel König, Markus Lohrey +1
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns ou…