Algorithms and Complexity (ACiD) Seminar: NP-Complete Problems in Graph Groups and Cryptographic Applications
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 firstname.lastname@example.org for more information