activity
20012009
most citedReport on Generic Case Complexity

9 citations · 28 across the 22 of their papers we have counts for

collaborators
Showing 2009 · math.GRShow all

5 papers · 2 filters

math.GR2009

Regular sets and counting in free groups

Elizaveta Frenkel, Alexei G. Myasnikov, Vladimir N. Remeslennikov

In this paper we study asymptotic behavior of regular subsets in a free group F of finite rank, compare their sizes at infinity, and develop techniques to compute the probabilities…

math.GR2009

Equations and fully residually free groups

Olga Kharlampovich, Alexei Myasnikov

This paper represents notes of the mini-courses given by the authors at the GCGTA conference in Dortmund (2007), Ottawa-Saint Sauveur conference (2007), Escola d'Algebra in Rio de…

math.GR2009

Generic complexity of the Conjugacy Problem in HNN-extensions and algorithmic stratification of Miller's groups

Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov

We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements,…

math.GR20092 cited

The Conjugacy Problem in Amalgamated Products I: Regular Elements and Black Holes

Alexandre V. Borovik, Alexei G. Myasnikov, Vladimir N. Remeslennikov

We discuss the time complexity of the word and conjugacy search problems for free products of groups and with amalgamation over a subgroup . We stratif…

math.GR2009

Groups Elementarily Equivalent to a Free 2-nilpotent Group of Finite Rank

Alexei G. Myasnikov, Mahmood Sohrabi

In this paper we find a characterization for groups elementarily equivalent to a free nilpotent group of class 2 and arbitrary finite rank.