Pages that link to "Item:Q4354236"
From MaRDI portal
The following pages link to Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236):
Displaying 13 items.
- Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
- A strong geometric hyperbolicity property for directed graphs and monoids. (Q743919) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- Groups finitely presented in Burnside varieties (Q2193231) (← links)
- Space functions of groups (Q2841376) (← links)
- DEHN FUNCTION AND LENGTH OF PROOFS (Q4464963) (← links)
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY (Q4658702) (← links)
- LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS (Q4786274) (← links)
- FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY (Q4824696) (← links)
- On Subquadratic Derivational Complexity of Semi-Thue Systems (Q5042260) (← links)
- Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS (Q5470158) (← links)
- A semigroup with linearithmic Dehn function (Q6651828) (← links)
