Complexity: Knots, Colourings and Counting
D. J. a. Welsh
(Author)
Description
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.
Product Details
Price
$71.49
Publisher
Cambridge University Press
Publish Date
August 27, 1993
Pages
172
Dimensions
6.04 X 9.0 X 0.45 inches | 0.63 pounds
Language
English
Type
Paperback
EAN/UPC
9780521457408
Earn by promoting books
Earn money by sharing your favorite books through our Affiliate program.
Become an affiliate
Reviews
"...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 Monthly
"...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
