Search Results

Documents authored by Kharlampovich, Olga


Document
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)

Authors: Volker Diekert, Olga Kharlampovich, Markus Lohrey, and Alexei Myasnikov

Published in: Dagstuhl Reports, Volume 9, Issue 3 (2019)


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.

Cite as

Volker Diekert, Olga Kharlampovich, Markus Lohrey, and Alexei Myasnikov. Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). In Dagstuhl Reports, Volume 9, Issue 3, pp. 83-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


Copy BibTex To Clipboard

@Article{diekert_et_al:DagRep.9.3.83,
  author =	{Diekert, Volker and Kharlampovich, Olga and Lohrey, Markus and Myasnikov, Alexei},
  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 =	{Diekert, Volker and Kharlampovich, Olga and Lohrey, Markus and Myasnikov, Alexei},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.3.83},
  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}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail