Efficient algorithms for highly compressed data: The word problem in Higman’s group is in P (0)

by V Diekert, J Laun, A Ushakov
Venue:International Journal of Algebra and Computation