Algorithmic problems in right-angled Artin groups: Complexity and applications
Flores, Ramon; Kahrobaei, Delaram; Koberda, Thomas
Publicación: JOURNAL OF ALGEBRA
2019
VL / 519 - BP / 111 - EP / 129
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. (C) 2018 Elsevier Inc. All rights reserved.
MENTIONS DATA
Mathematics
-
1 Twitter
-
1 Wikipedia
-
0 News
-
0 Policy
Publicaciones similares en Mathematics