Generic-case complexity (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Generic-case complexity" in English language version.

refsWebsite

Global rank English rank

69^th place

59^th place

low place

3,707^th place

2,409^th place

14^th place

archive.today

I. Kapovich, A. Myasnikov, P. Schupp and V. Shpilrain, Generic case complexity, decision problems in group theory and random walks, J. Algebra, vol 264 (2003), 665–694.
I. Kapovich, P. Schupp, V. Shpilrain, Generic properties of Whiteheads algorithm and isomorphism rigidity of random one-relator groups, Pacific J. Math. 223 (2006)
A.V. Borovik, A.G. Myasnikov, V.N. Remeslennikov, Generic complexity of the conjugacy problem in HNN-extensions and algorithmic stratification of Miller's groups, Internat. J. Algebra Comput. 17 (2007), 963–997.
J. D. Hamkins and A. Miasnikov, The halting problem is decidable on a set of asymptotic probability one, Notre Dame J. Formal Logic 47 (2006), 515–524.
A. D. Myasnikov, Generic Complexity and One-Way Functions, Groups, Complexity and Cryptography, 1, (2009), 13–31.

A. Miasnikov and A. Rybalov, Generic complexity of undecidable problems, Journal of Symbolic Logic 73 (2008), 656–673.

R. Gilman, A. G. Miasnikov, A. D. Myasnikov, and A. Ushakov, Report on generic case complexity, Herald of Omsk University, Special Issue, 2007, 103–110.