A family of polycyclic groups over which the uniform conjugacy problem is NP-complete

作者：Cavallo Bren^*; Kahrobaei Delaram

来源：International Journal of Algebra and Computation, 2014, 24(4): 515-530.

DOI：10.1142/S0218196714500234

• Polycyclic group (or poly-Z groups)
• conjugacy problem
• NP-completeness

In this paper, we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups G(n) whose conjugacy problem is at least as hard as the subset sum problem with n indeterminates. As such, the uniform conjugacy problem over the groups G(n) is NP-complete where the parameters of the problem are taken in terms of n and the length of the elements given on input.

• 出版日期2014-6