All Questions

I would like to know of any examples of families of groups that are known (or conjectured) to have a solvable uniform word problem, i.e. an algorithm that given a presentation $P$ of a group in the ...

For which properties (P) [of groups] does the following hold: given a group $G$ which has a finite presentation with at most $n$ relations of length at most $\ell$, there is a $R(n,\ell)$ so that, if ...

There are several well known classes of groups for which the word problem, conjugacy etc. are solvable in polynomial time (hyperbolic, automatic). Then there are several classes of groups like ...

If $G = \langle X | R \rangle$ is a $\delta$-hyperbolic group presentation, then Dehn's algorithm provides a linear time solution to the word problem, but the linear constant is horribly exponential ...