{
"item_title" : "Complexity",
"item_author" : [" Dominic Welsh "],
"item_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.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/145/740/0521457408_b.jpg",
"price_data" : {
"retail_price" : "72.00", "online_price" : "72.00", "our_price" : "72.00", "club_price" : "72.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Complexity : Knots, Colourings and Counting
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780521457408
- ISBN-10: 0521457408
- Publisher: Cambridge University Press
- Publish Date: August 1993
- Dimensions: 9 x 6.04 x 0.45 inches
- Shipping Weight: 0.63 pounds
- Page Count: 172
Related Categories
