The complexity of knapsack problems in wreath products

19 Feb 2020 Figelius Michael Ganardi Moses Lohrey Markus Zetzsche Georg

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 study the so-called power word problem (does a given expression $u_1^{k_1} \ldots u_d^{k_d}$, where $u_1, \ldots, u_d$ are words over the group generators and $k_1, \ldots, k_d$ are binary encoded integers, evaluate to the group identity?).. (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • GROUP THEORY
  • COMPUTATIONAL COMPLEXITY