Pages that link to "Item:Q2882827"
From MaRDI portal
The following pages link to Polynomial time conjugacy in wreath products and free solvable groups (Q2882827):
Displayed 10 items.
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
- Spherical quadratic equations in free metabelian groups (Q2790248) (← links)
- A family of polycyclic groups over which the uniform conjugacy problem is NP-complete (Q2876614) (← links)
- Time complexity of the conjugacy problem in relatively hyperbolic groups (Q2942798) (← links)
- THE MAGNUS EMBEDDING IS A QUASI-ISOMETRY (Q4904511) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
- (Q5150520) (← links)
- Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)} (Q5267968) (← links)