Pages that link to "Item:Q760501"
From MaRDI portal
The following pages link to On the complexity of intersection and conjugacy problems in free groups (Q760501):
Displaying 13 items.
- Algorithmic theory of free solvable groups: randomized computations. (Q402669) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552) (← links)
- Algorithmic problems for free-Abelian times free groups. (Q2438024) (← links)
- On the complexity of the endomorphism problem for free groups. (Q2759639) (← links)
- Polynomial time conjugacy in wreath products and free solvable groups. (Q2882827) (← links)
- (Q3115682) (← links)
- Obtaining Nielsen reduced sets in free groups (Q3971257) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- The computational complexity of torsion-freeness of finitely presented groups (Q4374809) (← links)
- FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY (Q4824696) (← links)
- GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS (Q5386949) (← links)