Complexity: Knots, Colourings and Countings
Format:Paperback
Publisher:Cambridge University Press
Published:12th Aug '93
Currently unavailable, and unfortunately no date known when it will be back
These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics, Rutgers University.
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.
"...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
ISBN: 9780521457408
Dimensions: 227mm x 151mm x 12mm
Weight: 259g
172 pages