Cited in
(10)- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- Rational subsets of groups
- Compression techniques in group theory
- The conjugacy problem for Higman’s group
- Taming the hydra: the word problem and extreme integer compression
- Efficient algorithms for highly compressed data: the word problem in Higman's group is in P.
- Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P
- WalnutDSA
- An attack on the Walnut digital signature algorithm
- Efficient algorithms for highly compressed data: the word problem in Higman's group is in P
This page was built for software: CRAG
