CRAG
From MaRDI portal
Software:18934
swMATH6865MaRDI QIDQ18934FDOQ18934
Author name not available (Why is that?)
Source code repository: https://github.com/stevens-crag/crag
Cited In (10)
- The conjugacy problem for Higman’s group
- The conjugacy problem in the Grigorchuk group is polynomial time decidable.
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
- Rational subsets of groups
- Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P
- Taming the hydra: The word problem and extreme integer compression
- An attack on the Walnut digital signature algorithm
- Compression techniques in group theory
- 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 Higman's group is in P
This page was built for software: CRAG
