Algorithmic problems in right-angled Artin groups: complexity and applications
classification
🧮 math.GR
math.ATmath.GT
keywords
problemsalgorithmicapplicationsartincomplexitygroupsright-angledclassical
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.