Skip to content
Register Sign in Wishlist
Complexity: Knots, Colourings and Countings

Complexity: Knots, Colourings and Countings

Part of London Mathematical Society Lecture Note Series

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

Paperback

Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

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

    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: 229 x 152 x 10 mm
    • weight: 0.26kg
    • 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
    References.

  • Author

    Dominic Welsh, University of Oxford

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

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

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 www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

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.

Cancel

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