London Mathematical Society Lecture Note Series. 186. Cambridge: Cambridge University Press. viii, 163 p. £19.95 (1993).
The aim of these notes is “to link together algorithmic problems arising in knot theory, statistical physics and classical combinatorics. Apart from the theory of computational complexity concerned with enumeration problems, introductions are given to several of the topics treated, such as combinatorial knot theory, randomised approximation algorithms, percolation and random cluster models.
To researchers in discrete mathematics, computer science and statistical physics, this book will be great interest, but any non-expert should find it an appealing guide to a very active area of research”.