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

Volker Diekert, Jürn Laun, Alexander Ushakov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Fingerprint

Dive into the research topics of 'Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P'. Together they form a unique fingerprint.

Mathematics

Computer Science