A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
2014 ◽
Vol 24
(04)
◽
pp. 515-530
◽
In this paper, we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups Gn 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 Gn is NP-complete where the parameters of the problem are taken in terms of n and the length of the elements given on input.
Keyword(s):
2018 ◽
Vol 84
◽
pp. 84-94
◽
Keyword(s):
2017 ◽
Vol 27
(03)
◽
pp. 349-350
2014 ◽
Vol E97.A
(1)
◽
pp. 298-299
◽
1990 ◽
Vol 26
(1)
◽
pp. 61-77
◽
1986 ◽
Vol 23
(1)
◽
pp. 11-17
◽
2001 ◽
Vol 34
(44)
◽
pp. 9555-9567
◽
2002 ◽
Vol 9
(4)
◽
pp. 437-459
◽