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

2003/05/12 by Ilya Kapovich, Alexei Myasnikov, Paul E. Schupp +2 · 2 citations
Mathematics · #Advanced Operator Algebra Research #Algorithm #Artificial intelligence #Class (philosophy) #Combinatorics #Complexity class #Computer science #Conjugacy class #Conjugacy problem #Decision problem #Discrete mathematics #Finite Group Theory Research #Geometric and Algebraic Topology #Group (periodic table) #Mathematics #Random walk #Time complexity

paper · pdf · doi:10.1016/s0021-8693(03)00167-4

openalex publication_date 2003/05/12 · crossref created 2003/05/12 · crossref issued 2003/06/01 · crossref published 2003/06/01 · crossref published-print 2003/06/01 · crossref deposited 2019/03/21 · openalex created_date 2025/10/10 · crossref indexed 2026/02/06 · openalex updated_date 2026/07/31

Citations

• A Public-Key Cryptosystem Based on the Word Problem
• Decision Problems for Groups — Survey and Reflections
• An Introduction to the Theory of Groups
• Free subgroups in linear groups
• The non-amenability of Schreier graphs for infinite index quasiconvex subgroups of hyperbolic groups

Cited by

• Counting loxodromics for hyperbolic actions
• Geometric group theory [wikipedia]