activity
20102016
most citedThe conjugacy problem in free solvable groups and wreath product of abelian groups is in TC

2 citations · 4 across the 4 of their papers we have counts for

collaborators
Showing 2010 · math.GRShow all

1 paper · 2 filters

math.GR2010

Polynomial time conjugacy in wreath products and free solvable groups

Svetla Vassileva

We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume…