The following pages link to CRAG (Q18934):
Displaying 10 items.
- The conjugacy problem in the Grigorchuk group is polynomial time decidable. (Q531917) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Rational subsets of groups (Q2244818) (← links)
- Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512) (← links)
- An attack on the Walnut digital signature algorithm (Q2324764) (← links)
- Efficient algorithms for highly compressed data: the word problem in Higman's group is in P (Q2904763) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
- The conjugacy problem for Higman’s group (Q4970526) (← links)