2 citations · 4 across the 4 of their papers we have counts for
4 papers
The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC
Alexei Miasnikov, Svetla Vassileva, Armin Weiß
We show that the conjugacy problem in a wreath product is uniform--Turing-reducible to the conjugacy problem in the factors and and the power probl…
Logspace and compressed-word computations in nilpotent groups
Jeremy Macdonald, Alexei Myasnikov, Andrey Nikolaev +1
For finitely generated nilpotent groups, we employ Mal'cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership prob…
The Magnus embedding is a quasi-isometry
Svetla Vassileva
We show that the Magnus embedding, which embeds the free solvable group of rank r and degree d into the wreath product of the free abelian group of rank r with the free solvable gr…
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…