Generic-case complexity, decision problems in group theory and random walks
Ilya Kapovich, Alexei Myasnikov, Paul Schupp, Vladimir Shpilrain
Abstract
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.
Create a lesson
Related papers
Sylow 2-Subgroups of Finite Groups with a Single Conjugacy Class of Involutions
Tianze Li, Yu Zeng
Twisted Equations and Palindrome Length
Volker Diekert, Anna E. Frid, Silas Natterer et al.
Almost tight asymptotic enumeration of finite p-groups: Almost all finite groups are 2-groups of class 2
Yinan Li, Youming Qiao
The R∞-nilpotency degree of some lollipop GBS groups
Wagner Sgobbi, Dalton Couto Silva, Daniel Vendrúscolo
Property R∞ for Artin and Coxeter groups whose outer automorphisms are length-preserving
Ignat Soroko
DL, DQ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups
Pallabi Manna, Santanu Mandal