Complexity: Knots, Colourings and Countings
Series: London Mathematical Society Lecture Note Series; 186;
- Publisher's listprice GBP 62.00
-
31 378 Ft (29 884 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 6 276 Ft off)
- Discounted price 25 103 Ft (23 907 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
31 378 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 12 August 1993
- ISBN 9780521457408
- Binding Paperback
- No. of pages172 pages
- Size 227x151x12 mm
- Weight 259 g
- Language English
- Illustrations 70 line figures 0
Categories
Short description:
These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics, Rutgers University.
MoreLong 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.
"...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
Table of Contents:
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.
More
