Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P

Volker Diekert, Jürn Laun, Alexander Ushakov. Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P. IJAC, 22(8), 2012. [doi]

Abstract

Abstract is missing.