• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Complexity: Knots, Colourings and Counting

Complexity: Knots, Colourings and Counting

Paperback

Series: London Mathematical Society Lecture Note, Book 186

FictionGeneral Mathematics

ISBN10: 0521457408
ISBN13: 9780521457408
Publisher: Cambridge University Press
Published: Aug 12 1993
Pages: 172
Weight: 0.63
Height: 0.45 Width: 6.04 Depth: 9.00
Language: English
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.

Also from

Welsh, D. J. a.

Also in

Fiction