Sciweavers

Share
CORR
2002
Springer

Generic-case complexity, decision problems in group theory and random walks

8 years 8 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theory - the word, conjugacy and membership problems - all have linear-time generic-case complexity. We prove such theorems by using the theory of random walks on regular graphs. Contents
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, Vladimir Shpilrain
Comments (0)
books