Complexity: Knots, Colourings and Countings

Sold by Ingram

This product may not be approved for your region.
  • Free Shipping

    On orders of AED 100 or more. Standard delivery within 5-15 days.
  • Free Reserve & Collect

    Reserve & Collect from Magrudy's or partner stores accross the UAE.
  • Cash On Delivery

    Pay when your order arrives.
  • Free returns

    See more about our return policy.
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 researchers in discrete mathematics, computer science and statistical physics, this book will be of great interest, but any non-expert should find it an appealing guide to a very active area of research.