Toggle Main Menu Toggle Search

Open Access padlockePrints

How hard is the word problem

Lookup NU author(s): Professor Sarah Rees


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


When the word problem of a group is soluble, it is natural to ask how hard the problem is. It is standard to use bounds on time, or on space, or at least to use measures which give information about those bounds. It is also common to analyse the type of computational machine which is needed to perform the calculation (which could range from the most general Turing machine to a simple finite state automaton). This survey article introduces and compares briefly some of these different measures of complexity.

Publication metadata

Author(s): Rees SE

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: European Women in Mathematics

Year of Conference: 2002