paper

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

arXiv:1102.2481

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.

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