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.
生成讲解博客的中文版本
生成AI智能校验的中文版本