Algorithmic problems in right-angled Artin groups: complexity and applications
arXiv:1802.04870
Abstract
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with a view towards applications to cryptography.
16 pages