Average-case complexity and decision problems in group theory

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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$.
Some misprints have been corrected

Keywords

Group Theory, Computational Complexity, Geometric Topology, 20F36

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/64398

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0206273
 http://arxiv.org/abs/math/0206273

Collections

arXiv