ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS

DOI10.1017/S0017089518000198zbMath1477.20069arXiv1610.06503WikidataQ129651872 ScholiaQ129651872MaRDI QIDQ5235128

Conchita Martínez-Pérez, Delaram Kahrobaei, Jonathan Gryak

Publication date: 7 October 2019

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06503

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Generalizations of solvable and nilpotent groups (20F19) Chains and lattices of subgroups, subnormal subgroups (20E15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Oblivious transfer using non-abelian groups ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructable solvable groups
• Conjugacy problem in metabelian groups
• On a problem of Philip Hall
• Matrix Analysis
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
• Erratum: A family of polycyclic groups over which the uniform conjugacy problem is NP-complete

This page was built for publication: ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS