Average-case complexity and decision problems in group theory

Simple item page
dc.creatorKapovich, Ilya
dc.creatorMyasnikov, Alexei
dc.creatorSchupp, Paul
dc.creatorShpilrain, Vladimir
dc.date2002-06-25
dc.date2002-08-22
dc.date.accessioned2026-07-07T04:49:22Z
dc.date.available2026-07-07T04:49:22Z
dc.descriptionWe investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group $G$ has the word problem solvable in subexponential time and has a subgroup of finite index which possesses a non-elementary word-hyperbolic quotient group, then the average-case complexity of the word problem for $G$ is linear time, uniformly with respect to the collection of all length-invariant measures on $G$. For example, the result applies to all braid groups $B_n$.
dc.descriptionSome misprints have been corrected
dc.identifierhttps://arxiv.org/abs/math/0206273
dc.identifierhttp://arxiv.org/abs/math/0206273
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64398
dc.subjectGroup Theory
dc.subjectComputational Complexity
dc.subjectGeometric Topology
dc.subject20F36
dc.titleAverage-case complexity and decision problems in group theory
dc.typetext

Files

Collections

arXiv