Average-case complexity and decision problems in group theory

Details Average-case complexity and decision problems in group theory Average-case complexity and decision problems in group theory

2002-06-25

arxiv.org/abs/math/0206273v2

Mathematics

Group Theory

Some misprints have been corrected

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

Average-case complexity and decision problems in group theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Average-case complexity and decision problems in group theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average-case complexity and decision problems in group theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195512