Polynomial time conjugacy in wreath products and free solvable groups

DOI10.1515/gcc.2011.005zbMath1242.20038arXiv1011.5931OpenAlexW1981151457MaRDI QIDQ2882827

Svetla Vassileva

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

zbMATH Keywords

complexitywreath productsconjugacy problemfree solvable groupsconjugacy search problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (10)

The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) ⋮ Time complexity of the conjugacy problem in relatively hyperbolic groups ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ Algorithmic theory of free solvable groups: randomized computations. ⋮ THE MAGNUS EMBEDDING IS A QUASI-ISOMETRY ⋮ Spherical quadratic equations in free metabelian groups ⋮ The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) ⋮ Unnamed Item ⋮ Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)} ⋮ A family of polycyclic groups over which the uniform conjugacy problem is NP-complete

Cites Work

• Small cancellation theory and automatic groups. II
• Conjugacy in polycyclic groups
• SOLVING THE WORD PROBLEM IN REAL TIME
• An example of a finitely presented amenable group not belonging to the classEG
• Conjugacy in Nilpotent Groups
• THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS

This page was built for publication: Polynomial time conjugacy in wreath products and free solvable groups