Complexity: Knots, Colourings and Countings


Write The First Customer Review
Show Synopsis

These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics held at Rutgers University. Their aim 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 ...

Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

Customer Reviews

Write a Review

This item doesn't have extra editions