Polynomial time conjugacy in wreath products and free solvable groups
From MaRDI portal
Publication:2882827
DOI10.1515/gcc.2011.005zbMath1242.20038arXiv1011.5931MaRDI QIDQ2882827
Publication date: 7 May 2012
Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.5931
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
20F16: Solvable groups, supersolvable groups
20E22: Extensions, wreath products, and other compositions of groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
THE MAGNUS EMBEDDING IS A QUASI-ISOMETRY, Unnamed Item, Logspace and compressed-word computations in nilpotent groups, Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)}, Algorithmic theory of free solvable groups: randomized computations., The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\), The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\), Spherical quadratic equations in free metabelian groups, A family of polycyclic groups over which the uniform conjugacy problem is NP-complete, Time complexity of the conjugacy problem in relatively hyperbolic groups
Cites Work