Algorithmic theory of free solvable groups: Randomized computations

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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.

Original languageEnglish
Pages (from-to)178-200
Number of pages23
JournalJournal of Algebra
Volume407
DOIs
StatePublished - 1 Jun 2014

Keywords

  • Conjugacy problem
  • Cyclic subgroup membership
  • Metabelian groups
  • Power problem
  • Randomized algorithms
  • Solvable groups
  • Word problem

Fingerprint

Dive into the research topics of 'Algorithmic theory of free solvable groups: Randomized computations'. Together they form a unique fingerprint.

Cite this