Complexity: Knots, Colourings and Countings
Part of London Mathematical Society Lecture Note Series
- Author: Dominic Welsh, University of Oxford
- Date Published: August 1993
- availability: Available
- format: Paperback
- isbn: 9780521457408
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.
-
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.
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: August 1993
- format: Paperback
- isbn: 9780521457408
- length: 172 pages
- dimensions: 227 x 151 x 12 mm
- weight: 0.259kg
- contains: 70 line figures
- availability: Available
Table of Contents
1. The complexity of enumeration
2. Knots and links
3. Colourings, flows and polynomials
4. Statistical physics
5. Link polynomials
6. Complexity questions
7. The complexity of uniqueness and parity
8. Approximation and randomisation
References.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×