Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | Symposium on Theoretical Aspects of Computer Science |
| Author | Diekert, Volker, Laun, Jürn, Ushakov, Alexander |
| Maintainer | CCSD |
| Last Updated | May 25, 2026, 03:26 (UTC) |
| Created | May 25, 2026, 03:26 (UTC) |
| Identifier | hal-00678191 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | University of Stuttgart = Universität Stuttgart |
| coverage | Paris, France |
| creator | Diekert, Volker |
| date | 2012-02-29T00:00:00 |
| harvest_object_id | ee9f12d5-388d-4fc8-8bef-de790fdfa1f1 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-02-19T00:00:00 |
| set_spec | type:COMM |