Pages that link to "Item:Q2254512"
From MaRDI portal
The following pages link to Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512):
Displaying 6 items.
- Efficient algorithms for highly compressed data: the word problem in Higman's group is in P (Q2904763) (← links)
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- The conjugacy problem for Higman’s group (Q4970526) (← links)
- The Compressed Word Problem for Groups (Q5405102) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)