Skip to content

All SAP systems will be unavailable on Saturday 10th December 2022 from 0800-1800 UK Time.

If you can’t place an order, please contact Customer Services to complete your order.

UK/ROW +44 (0) 1223 326050 | US 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Register Sign in Wishlist
Complexity: Knots, Colourings and Countings

Complexity: Knots, Colourings and Countings

$64.99 (C)

Part of London Mathematical Society Lecture Note Series

  • Date Published: August 1993
  • availability: Available
  • format: Paperback
  • isbn: 9780521457408

$ 64.99 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    Reviews & endorsements

    "...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

    " 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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: August 1993
    • format: Paperback
    • isbn: 9780521457408
    • length: 172 pages
    • dimensions: 227 x 151 x 12 mm
    • weight: 0.259kg
    • contains: 70 line figures
    • availability: Available
  • 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

  • Author

    Dominic Welsh, University of Oxford

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.