Algorithmic theory of free solvable groups: randomized computations
classification
🧮 math.GR
keywords
problemalgorithmsfreegroupsrandomizedsolvablesolvedtime
read the original abstract
We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can be solved in quasi-quartic time by Monte Carlo type algorithms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.