eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Reports
2192-5283
2019-09-12
83
110
10.4230/DagRep.9.3.83
article
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)
Diekert, Volker
Kharlampovich, Olga
Lohrey, Markus
Myasnikov, Alexei
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.
https://drops.dagstuhl.de/storage/04dagstuhl-reports/volume09/issue03/19131/DagRep.9.3.83/DagRep.9.3.83.pdf
algorithmic group theory; generic-case complexity; circuit complexity; diophantine theories