DROPS

Document

DOI: 10.4230/LIPIcs.STACS.2012.218

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

Authors: Volker Diekert, Jürn Laun, and Alexander Ushakov

Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)

Abstract

Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag group is in P. Before that the best known upper bound was non-elementary. In the present paper we provide new results for power circuits and we give new applications in algorithmic group theory: 1. We define a modified reduction procedure on power circuits which runs in quadratic time thereby improving the known cubic time complexity. 2. We improve the complexity of the Word Problem for the Baumslag group to cubic time thereby providing the first practical algorithm for that problem. (The algorithm has been implemented and is available in the CRAG library.) 3. The main result is that the Word Problem of Higman's group is decidable in polynomial time. The situation for Higman's group is more complicated than for the Baumslag group and forced us to advance the theory of Power Circuits.

Cite as

Volker Diekert, Jürn Laun, and Alexander Ushakov. Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 218-229, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{diekert_et_al:LIPIcs.STACS.2012.218,
  author =	{Diekert, Volker and Laun, J\"{u}rn and Ushakov, Alexander},
  title =	{{Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{218--229},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{D\"{u}rr, Christoph and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.218},
  URN =		{urn:nbn:de:0030-drops-34204},
  doi =		{10.4230/LIPIcs.STACS.2012.218},
  annote =	{Keywords: Algorithmic group theory, Data structures, Compression, Word Problem}
}

Search Results

Documents authored by Laun, Jürn

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

Abstract

Cite as

Thanks for your feedback!

Could not send message