Pages that link to "Item:Q1243275"
From MaRDI portal
The following pages link to Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen (Q1243275):
Displaying 8 items.
- The Nielsen reduction and P-complete problems in free groups (Q760500) (← links)
- Model-theoretic and algorithmic questions in group theory (Q1063112) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (Q4304125) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY (Q4824696) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
