Pages that link to "Item:Q2904763"
From MaRDI portal
The following pages link to Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P (Q2904763):
Displayed 6 items.
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- The conjugacy problem for Higman’s group (Q4970526) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)