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

DOI10.1142/S0218196717920011MaRDI QIDQ5269899zbMATH OpenFDO

Authors Bren Cavallo, Delaram Kahrobaei

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

Cites work

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

Cited in

(2)

• ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
• Erratum to: ``Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269899)