Pages that link to "Item:Q3828191"
From MaRDI portal
The following pages link to Decidable Properties of Polycyclic Groups (Q3828191):
Displaying 18 items.
- The status of polycyclic group-based cryptography: a survey and open problems (Q338844) (← links)
- The isomorphism problem for all hyperbolic groups. (Q540014) (← links)
- On rigidity and the isomorphism problem for tree braid groups. (Q838401) (← links)
- The isomorphism problem for finitely generated fully residually free groups. (Q860430) (← links)
- The isomorphism problem for toral relatively hyperbolic groups. (Q1044356) (← links)
- The algorithmic theory of polycyclic-by-finite groups (Q1178862) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- Deciding isomorphy using Dehn fillings, the splitting case (Q1717653) (← links)
- A practical algorithm for finding matrix representations for polycyclic groups (Q1974696) (← links)
- Subgroup conjugacy separability of free-by-finite groups. (Q2257985) (← links)
- Algorithmic recognition of infinite cyclic extensions (Q2396795) (← links)
- Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two (Q2676823) (← links)
- Surfaces of general type with geometric genus zero: a survey (Q3098613) (← links)
- Groups with Cyclic Outer Automizers (Q3191842) (← links)
- Generation of polycyclic groups (Q3393373) (← links)
- The Algorithmic Theory of Finitely Generated Metabelian Groups (Q4311344) (← links)
- Derivations and the permutability of subgroups in polycyclic-by-finite groups (Q4547017) (← links)
- Algorithmic problems in Engel groups and cryptographic applications (Q5124360) (← links)