TY - JOUR
T1 - Algorithmic theory of free solvable groups
T2 - Randomized computations
AU - Ushakov, Alexander
PY - 2014/6/1
Y1 - 2014/6/1
N2 - 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.
AB - 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.
KW - Conjugacy problem
KW - Cyclic subgroup membership
KW - Metabelian groups
KW - Power problem
KW - Randomized algorithms
KW - Solvable groups
KW - Word problem
UR - http://www.scopus.com/inward/record.url?scp=84897415856&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84897415856&partnerID=8YFLogxK
U2 - 10.1016/j.jalgebra.2014.02.014
DO - 10.1016/j.jalgebra.2014.02.014
M3 - Article
AN - SCOPUS:84897415856
SN - 0021-8693
VL - 407
SP - 178
EP - 200
JO - Journal of Algebra
JF - Journal of Algebra
ER -