Pages that link to "Item:Q2306657"
From MaRDI portal
The following pages link to The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657):
Displaying 3 items.
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527) (← links)
- Higher dimensional generalizations of the Thompson groups (Q2182286) (← links)
- Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427) (← links)