  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.
