The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable

Published 12 Feb 2011 in math.GR | (1102.2481v1)

Abstract: 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.

Authors (3)

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.