Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.30
URN: urn:nbn:de:0030-drops-64458
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6445/
Dison, Will ; Einstein, Eduard ; Riley, Timothy R.
Ackermannian Integer Compression and the Word Problem for Hydra Groups
| pdf-format: |
|
Abstract
For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applying the defining relations. Dison and Riley showed that a "hydra phenomenon" gives rise to novel groups with extremely fast growing (Ackermannian) Dehn functions. Here we show that nevertheless, there are efficient (polynomial time) solutions to the word problems of these groups. Our main innovation is a means of computing efficiently with enormous integers which are represented in compressed forms by strings of Ackermann functions.
BibTeX - Entry
@InProceedings{dison_et_al:LIPIcs:2016:6445,
author = {Will Dison and Eduard Einstein and Timothy R. Riley},
title = {{Ackermannian Integer Compression and the Word Problem for Hydra Groups}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6445},
URN = {urn:nbn:de:0030-drops-64458},
doi = {10.4230/LIPIcs.MFCS.2016.30},
annote = {Keywords: Ackermann functions, hydra, word problem}
}
| Keywords: | Ackermann functions, hydra, word problem | |
| Seminar: | 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 19.08.2016 |
