Pages that link to "Item:Q3718927"
From MaRDI portal
The following pages link to The complexity of Dehn's algorithm for word problems in groups (Q3718927):
Displaying 8 items.
- Average-case complexity and decision problems in group theory. (Q703812) (← links)
- A catalogue of complete group presentations (Q1097968) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- Generic-case complexity, decision problems in group theory, and random walks. (Q1399190) (← links)
- Polynomial-time proofs that groups are hyperbolic (Q2229726) (← links)
- ON A GENERALIZATION OF DEHN'S ALGORITHM (Q3606403) (← links)
- WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM (Q4786246) (← links)
