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

arxiv: 1102.2481 · v1 · pith:MYU455W6new · submitted 2011-02-12 · 🧮 math.GR

Alexei Miasnikov , Alexander Ushakov , Dong Wook Won This is my paper

classification 🧮 math.GR

keywords baumslagdecidabledehnfunctiongroupnon-elementarypolynomialproblem

0 comments

read the original 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.

This paper has not been read by Pith yet.