P — complete problems in free groups

Abstract

A powerfull tool for solving algorithmic problems in free groups is the concept of Nielsen reduction. Since the Nielsen reduction can be done in polynomial time, many problems such as the generalized word problem, the equality and the isomorphism problem for subgroups are solvable in polynomial time. Even more, we show that these problems are P — complete under log-space reducibility.