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.
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.
Get Complexity by Dominic Welsh at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has 172 pages.
Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.
Your privacy, your choice
Make Werezi work for you
We use essential cookies for your cart and sign-in. With your permission, optional cookies help us understand how Werezi is used and improve your book recommendations.
Essential cookies are always active. Optional analytics stay off unless you choose Allow all.