Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131)

Authors Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei Myasnikov and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.9.3.83.pdf
  • Filesize: 3.73 MB
  • 28 pages

Document Identifiers

Author Details

Volker Diekert
Olga Kharlampovich
Markus Lohrey
Alexei Myasnikov
and all authors of the abstracts in this report

Cite AsGet BibTex

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)
https://doi.org/10.4230/DagRep.9.3.83

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.
Keywords
  • algorithmic group theory; generic-case complexity; circuit complexity; diophantine theories

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
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