License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.9.3.83
URN: urn:nbn:de:0030-drops-112939
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11293/
Go back to Dagstuhl Reports

Diekert, Volker ; Kharlampovich, Olga ; Lohrey, Markus ; Myasnikov, Alexei
Weitere Beteiligte (Hrsg. etc.): Volker Diekert and Olga Kharlampovich and Markus Lohrey and Alexei Myasnikov

Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)

pdf-format:
dagrep_v009_i003_p083_19131.pdf (4 MB)

Abstract

Since its early days, combinatorial group theory was deeply interwoven with computability theory. In the last 20 years we have seen many new successful interactions between group theory and computer science. On one hand, groups played an important rule in many developments in complexity theory and automata theory. On the other hand, concepts from these computer science fields as well as efficient algorithms, cryptography, and data compression led to the formulation of new questions in group theory. The Dagstuhl Seminar Algorithmic Problems in Group Theory was aimed at bringing together researchers from group theory and computer science so that they can share their expertise. This report documents the material presented during the course of the seminar.

BibTeX - Entry

@Article{diekert_et_al:DR:2019:11293,
  author =	{Volker Diekert and Olga Kharlampovich and Markus Lohrey and Alexei Myasnikov},
  title =	{{Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)}},
  pages =	{83--110},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{3},
  editor =	{Volker Diekert and Olga Kharlampovich and Markus Lohrey and Alexei Myasnikov},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11293},
  URN =		{urn:nbn:de:0030-drops-112939},
  doi =		{10.4230/DagRep.9.3.83},
  annote =	{Keywords: algorithmic group theory; generic-case complexity; circuit complexity; diophantine theories}
}

Keywords: algorithmic group theory; generic-case complexity; circuit complexity; diophantine theories
Collection: Dagstuhl Reports, Volume 9, Issue 3
Issue Date: 2019
Date of publication: 12.09.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI