12 citations · 64 across the 32 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013★ 2 cited
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
Volker Diekert, Alexei Miasnikov, Armin Weiß
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjuga…
cs.DM2013★ 3 cited
Logspace computations in graph products
Volker Diekert, Jonathan Kausch
We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to gra…