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

DOI10.1142/S0218196717920011zbMath1366.20019MaRDI QIDQ5269899

Delaram Kahrobaei, Bren Cavallo

Publication date: 28 June 2017

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Solvable groups, supersolvable groups (20F16) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS

Cites Work

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

This page was built for publication: Erratum: A family of polycyclic groups over which the uniform conjugacy problem is NP-complete