6 citations · 6 across the 3 of their papers we have counts for
1 paper · 1 filter
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…