By the same authors

From the same journal

From the same journal

Algorithmic problems in right-angled Artin groups: complexity and applications

Research output: Contribution to journalArticlepeer-review



Publication details

JournalJournal of Algebra
DateE-pub ahead of print - 3 Nov 2018
DatePublished (current) - 1 Feb 2019
Pages (from-to)111-129
Early online date3/11/18
Original languageEnglish


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.

Bibliographical note

16 pages

    Research areas

  • math.GR, math.AT, math.GT, 20F36

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations