Pages that link to "Item:Q4304125"
From MaRDI portal
The following pages link to Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (Q4304125):
Displaying 12 items.
- Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- Space functions of groups. (Q2841376) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- (Q4406627) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY (Q4824696) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
