The Bounded and Precise Word Problems for Presentations of Groups

Introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. The main technical result of the paper states that, for certain finite presentations of groups the bounded word problem and the precise word problem can be solved in polylogarithmic space.