The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable
Group Theory
2011-02-15 v1
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.
Cite
@article{arxiv.1102.2481,
title = {The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable},
author = {Alexei Miasnikov and Alexander Ushakov and Dong Wook Won},
journal= {arXiv preprint arXiv:1102.2481},
year = {2011}
}