An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking 'kslices' of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The