Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Durham University

Computer Science

Seminars

 

Algorithms and Complexity (ACiD) Seminar: NP-Complete Problems in Graph Groups and Cryptographic Applications

Presented by Delaram Kahrobaei, University of York
19 November 2019 13:00 in E245

In this talk, we consider several classical and novel algorithmic problems for graph groups, which are also known as right-angled Artin groups or RAAGs. Many of these problems are closely related to graph theoretic problems, and their computational complexity is of intrinsic interest. Moreover, we are interested in these problems from the point of view of applications to cryptography. This is a joint work with R. Flores (Seville) and T. Koberda (Virginia).

Contact algorithms.complexity@dur.ac.uk for more information