This monograph presents an approach to complexity theory which offers a
means of analysing algorithms in terms of their tractability. This will
be suitable for graduate students and researchers in computer science
and mathematics, particularly those studying complexity theory.