Complexity: Knots, Colourings and Countings

London Mathematical Society Lecture Note #186

by Dominic Welsh

The aim of these notes is to link algorithmic problems arising in knot theory with statistical physics and classical combinatorics. Apart from the theory of computational complexity needed to deal with enumeration problems, introductions are given to several of the topics, such as combinatorial knot theory, randomized approximation models, percolation, and random cluster models.

172 pages, Paperback

First published January 1, 1993