Pages that link to "Item:Q1243274"
From MaRDI portal
The following pages link to Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität (Q1243274):
Displaying 11 items.
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← 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)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- The complexity of Grigorchuk groups with application to cryptography (Q1177176) (← links)
- Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen (Q1243275) (← links)
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (Q1399980) (← links)
- Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems (Q3741791) (← links)
- (Q3957134) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)