3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.GR2011
The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable
Alexei Miasnikov, Alexander Ushakov, Dong Wook Won
We prove that the Word problem in the Baumslag group G(1,2) which has a non-elementary Dehn function is decidable in polynomial time.
math.GR2010★ 3 cited
Power Circuits, Exponential Algebra, and Time Complexity
Alexei G. Myasnikov, Alexander Ushakov, Dong Wook Won
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the f…