Pages that link to "Item:Q4786291"
From MaRDI portal
The following pages link to COMPUTATION IN WORD-HYPERBOLIC GROUPS (Q4786291):
Displaying 13 items.
- Exponentially generic subsets of groups (Q716408) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Detecting conjugacy stability of subgroups in certain classes of groups (Q2037525) (← links)
- Polynomial-time proofs that groups are hyperbolic (Q2229726) (← links)
- Stallings graphs for quasi-convex subgroups (Q2401628) (← links)
- Some geodesic problems in groups (Q3085995) (← links)
- GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE (Q3528858) (← links)
- Orbit decidability and the conjugacy problem for some extensions of groups (Q3552098) (← links)
- (Q4946213) (← links)
- The Development of the Theory of Automatic Groups (Q5055450) (← links)
- Quadratic equations in hyperbolic groups are NP-complete (Q5267969) (← links)
- THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS (Q5483462) (← links)
- Geometric algorithms for discreteness and faithfulness (Q5886549) (← links)
