Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P.

Volker Diekert, Jrn Laun, Alexander Ushakov

Browse the full STACS paper archive.