Complexity: Knots, Colourings and Countings
$64.99 (C)
Part of London Mathematical Society Lecture Note Series
- Author: Dominic Welsh, University of Oxford
- Date Published: August 1993
- availability: Available
- format: Paperback
- isbn: 9780521457408
$
64.99
(C)
Paperback
Other available formats:
eBook
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
-
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.
Reviews & endorsements
"...suitable for advanced graduate students and researchers in complexity theory...The list of references is long and good, and the index is useful." Computing Reviews
See more reviews"...an urbane presentation...of the seemingly disparate threads that will some day be the new math...the author has attained a degree of clarity and readability that few mathematicians today are capable of." Gian-Carlo Rota
"...certain to be a valuable reference..." Lorenzo Traldi, Mathematical Reviews
"A clear and up-to-date survey of what's known--and what's still unknown." American Mathematical Monthly
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.
Related Books
related journals
also by this author
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.
×