33 citations · 92 across the 24 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.GR2011
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
Volker Diekert, Jürn Laun, Alexander Ushakov
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov…
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.