arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.04870math.GRmath.ATmath.GT
收藏

直角Artin群中的数学问题:复杂性及应用

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

Ramón Flores, Delaram Kahrobaei, Thomas Koberda

摘要:

本文考虑了直角Artin群的几个经典和新颖的算法问题,其中一些与图论问题密切相关,并研究了它们的计算复杂性.我们研究这些问题,以期应用到密码学。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑