Complexity: Knots, Colourings and Countings
1st Edition
Published on 11. July 2013
978-1-107-10854-7 (ISBN)
Description
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.
Reviews / Votes
"...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 "...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 MonthlyMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Illustrations
70 line figures
File size
8566,49 MB
ISBN-13
978-1-107-10854-7 (9781107108547)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
08/1993
Cambridge University Press
€72.00
Shipment within 15-20 days
Person
Content
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.
