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

We prove that the Word Problem in the Baumslag group G ( 1 , 2 ) = 〈 a , b ; a a b = a 2 〉 which has a non-elementary Dehn function is decidable in polynomial time.